perm filename W87.IN[LET,JMC]1 blob
sn#838361 filedate 1987-04-10 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00757 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00084 00002 ∂01-Jan-87 1400 SJG multi-valued logics
C00087 00003 ∂02-Jan-87 1056 CHANDRA%OSU-20@ohio-state.ARPA Support request for TICIP Workshop
C00089 00004 ∂02-Jan-87 1453 ME Prancing Pony Bill
C00091 00005 ∂04-Jan-87 1526 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
C00093 00006 ∂04-Jan-87 1814 @RELAY.CS.NET,@utterly.ai.toronto.edu:hector@AI.AI.MIT.EDU status report
C00102 00007 ∂05-Jan-87 0741 yoav%wisdom.bitnet@WISCVM.WISC.EDU me
C00104 00008 ∂05-Jan-87 0848 RICHARDSON@Score.Stanford.EDU AI Faculty Meeting
C00105 00009 ∂05-Jan-87 1005 AIR lectures
C00106 00010 ∂05-Jan-87 1113 RA Susan McCarthy
C00107 00011 ∂05-Jan-87 1144 RA Howard Boyer
C00108 00012 ∂05-Jan-87 1448 RA Eli Gray
C00109 00013 ∂05-Jan-87 1520 EPPLEY@Score.Stanford.EDU New telephone number
C00111 00014 ∂05-Jan-87 1602 LES
C00112 00015 ∂05-Jan-87 1625 oshea.pa@Xerox.COM re: Video lectures for new Xerox President
C00114 00016 ∂05-Jan-87 1730 guibas@decwrl.dec.com Theory Searches
C00116 00017 ∂05-Jan-87 1738 NILSSON@Score.Stanford.EDU Sr. Fac. Mtg.
C00119 00018 ∂06-Jan-87 0231 YOAV%WISDOM.BITNET@BERKELEY.EDU re: you
C00120 00019 ∂06-Jan-87 0952 REGES@Score.Stanford.EDU Re: Play about Turing's life
C00122 00020 ∂06-Jan-87 1050 NILSSON@Score.Stanford.EDU Phone Call
C00124 00021 ∂06-Jan-87 1335 KHOWARD@Score.Stanford.EDU message
C00125 00022 ∂06-Jan-87 1433 RA Professorship dinner
C00126 00023 ∂06-Jan-87 1639 guibas@decwrl.dec.com new meeting time: Thursday (1/8), after AFLB in the same room
C00128 00024 ∂06-Jan-87 1717 SCHAFFER@sushi.stanford.edu Inviting candidates for AFLB
C00130 00025 ∂06-Jan-87 1740 LES DEC-10 History Project
C00141 00026 ∂07-Jan-87 0832 PETTY@RED.RUTGERS.EDU '87January abstract mailing
C00145 00027 ∂07-Jan-87 0910 RICHARDSON@Score.Stanford.EDU Reception for Jean-Claude Latombe
C00146 00028 ∂07-Jan-87 0923 RA meeting with NSF people
C00147 00029 ∂07-Jan-87 0937 CLT Qlisp meeting reminder
C00148 00030 ∂07-Jan-87 1047 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU re: star wars continued
C00153 00031 ∂07-Jan-87 1305 RA Professorship dinner
C00155 00032 ∂07-Jan-87 1353 KHOWARD@Score.Stanford.EDU message
C00156 00033 ∂07-Jan-87 1457 YOUNG@Sushi.Stanford.EDU CS326 Grade Change
C00158 00034 ∂07-Jan-87 1510 RA Orlov's visit
C00159 00035 ∂07-Jan-87 1558 VAL cs326
C00160 00036 ∂07-Jan-87 1642 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00162 00037 ∂07-Jan-87 1649 VAL question
C00164 00038 ∂08-Jan-87 0300 JMC
C00165 00039 ∂08-Jan-87 0619 CHANDRA%OSU-20@ohio-state.ARPA re: Support request for TICIP Workshop
C00167 00040 ∂08-Jan-87 1000 JMC
C00168 00041 ∂08-Jan-87 1000 JMC
C00170 00042 ∂08-Jan-87 1056 RA 12:30 tel. call
C00171 00043 ∂08-Jan-87 1151 LES Call to Amarel
C00172 00044 ∂08-Jan-87 1200 JMC
C00173 00045 ∂08-Jan-87 1229 REGES@Score.Stanford.EDU TA for 326?
C00174 00046 ∂08-Jan-87 1314 RA do you mind?
C00175 00047 ∂08-Jan-87 1327 RA meeting in D.C. 1/21
C00176 00048 ∂08-Jan-87 1331 RA your telephone
C00177 00049 ∂08-Jan-87 1452 RA Richard Stearns
C00178 00050 ∂08-Jan-87 1546 GUNNING@Sushi.Stanford.EDU McDermott and the endgame problem
C00180 00051 ∂08-Jan-87 1732 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
C00182 00052 ∂08-Jan-87 1743 ROBERTS@Sushi.Stanford.EDU re: SERC probation report!
C00185 00053 ∂09-Jan-87 1001 JMC
C00186 00054 ∂09-Jan-87 1022 RA meetings 1/21/87
C00187 00055 ∂09-Jan-87 1043 VAL WICS
C00188 00056 ∂09-Jan-87 1141 SCHAFFER@sushi.stanford.edu Daniel Sleator's visit
C00190 00057 ∂09-Jan-87 1153 RA please call
C00191 00058 ∂09-Jan-87 1500 JMC
C00192 00059 ∂09-Jan-87 1517 VAL
C00193 00060 ∂09-Jan-87 1618 RA Carl Ruoff
C00194 00061 ∂09-Jan-87 1640 JUTTA@Score.Stanford.EDU re: MS Committee meeting
C00195 00062 ∂09-Jan-87 1645 ortiz@spam.istc.sri.com Approximate Theories
C00197 00063 ∂09-Jan-87 1751 LES
C00198 00064 ∂10-Jan-87 0745 JJW 2400 baud modems
C00199 00065 ∂10-Jan-87 0904 ullman@navajo.stanford.edu Re: Daniel Sleator's visit
C00200 00066 ∂10-Jan-87 1954 guibas@decwrl.dec.com summary of meeting, January 8, 1987
C00202 00067 ∂11-Jan-87 0153 GLB
C00210 00068 ∂11-Jan-87 1321 OKUNO@SUMEX-AIM.STANFORD.EDU Thanks
C00211 00069 ∂11-Jan-87 1342 JUSTESON@Sushi.Stanford.EDU Problem 4
C00213 00070 ∂11-Jan-87 1440 MAYR@score.stanford.edu hosting Cole
C00214 00071 ∂11-Jan-87 1504 ANDY@Sushi.Stanford.EDU re: Libertarian
C00218 00072 ∂11-Jan-87 1818 VAL re: Problem 4
C00219 00073 ∂11-Jan-87 1856 MACMILK@Score.Stanford.EDU re: address book/week-at-a-glance 1985 found
C00221 00074 ∂11-Jan-87 1918 NILSSON@Score.Stanford.EDU Re: private offices for Senior Research Associates
C00223 00075 ∂11-Jan-87 1919 NILSSON@Score.Stanford.EDU Re: private offices for Senior Research Associates
C00224 00076 ∂12-Jan-87 1035 RA Steven Graubard
C00225 00077 ∂12-Jan-87 1105 VAL wics
C00226 00078 ∂12-Jan-87 1112 RA Kent Curtis
C00227 00079 ∂12-Jan-87 1227 VAL
C00228 00080 ∂12-Jan-87 1315 TEICH@Sushi.Stanford.EDU My degree plan
C00231 00081 ∂12-Jan-87 1437 CLT blanks
C00235 00082 ∂13-Jan-87 1004 VAL common.tex[e80,jmc]
C00236 00083 ∂13-Jan-87 1006 SJG George Gratzer
C00237 00084 ∂13-Jan-87 1050 VAL
C00238 00085 ∂13-Jan-87 1059 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
C00242 00086 ∂13-Jan-87 1215 edsel!sunvalleymall!jlz@navajo.stanford.edu short bio please
C00244 00087 ∂13-Jan-87 1432 RA Richard Schroeppel
C00245 00088 ∂13-Jan-87 2019 ME PTYs
C00246 00089 ∂13-Jan-87 2030 TEICH@Sushi.Stanford.EDU re: My degree plan
C00248 00090 ∂13-Jan-87 2041 oshea.pa@Xerox.COM re: video interview Wed 14th
C00250 00091 ∂13-Jan-87 2141 TEICH@Sushi.Stanford.EDU re: My degree plan
C00252 00092 ∂13-Jan-87 2317 ME old files being restored
C00254 00093 ∂14-Jan-87 0759 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
C00256 00094 ∂14-Jan-87 0903 RA video this morning
C00257 00095 ∂14-Jan-87 0916 oshea.pa@Xerox.COM re: video interview Wed 14th
C00259 00096 ∂14-Jan-87 1018 GSMITH@SUMEX-AIM.STANFORD.EDU Re: retreat
C00261 00097 ∂14-Jan-87 1046 SJG question about Marek's "forcing" paper from the Mohonk workshop
C00262 00098 ∂14-Jan-87 1120 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
C00264 00099 ∂14-Jan-87 1123 CLT This week's Qlisp meeting
C00265 00100 ∂14-Jan-87 1146 RICHARDSON@Score.Stanford.EDU Oliger/Winograd
C00267 00101 ∂14-Jan-87 1242 RA Susan
C00268 00102 ∂14-Jan-87 1245 RA [Reply to message recvd: 14 Jan 87 12:27 Pacific Time]
C00269 00103 ∂14-Jan-87 1456 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C00271 00104 ∂14-Jan-87 1523 VAL trip to Washington
C00272 00105 ∂14-Jan-87 1550 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU thanks
C00275 00106 ∂15-Jan-87 0036 LES Timesharing Memo
C00276 00107 ∂15-Jan-87 0802 @Score.Stanford.EDU:FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: AI Planning Retreat
C00278 00108 ∂15-Jan-87 0807 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
C00280 00109 ∂15-Jan-87 0853 AI.BOYER@MCC.COM Stallman Course
C00282 00110 ∂15-Jan-87 0857 RICHARDSON@Score.Stanford.EDU AI Faculty Meeting
C00283 00111 ∂15-Jan-87 0920 RA
C00284 00112 ∂15-Jan-87 0956 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
C00286 00113 ∂15-Jan-87 1008 RA Provost invitation
C00287 00114 ∂15-Jan-87 1201 RA your interview
C00288 00115 ∂15-Jan-87 1234 SCHAFFER@sushi.stanford.edu Tentative Visit Dates
C00291 00116 ∂15-Jan-87 1245 SCHAFFER@sushi.stanford.edu Tentative Visit Dates
C00293 00117 ∂15-Jan-87 1316 AI.BOYER@MCC.COM Stallman Course
C00307 00118 ∂15-Jan-87 1346 RA Robert Jastrow
C00308 00119 ∂15-Jan-87 1347 RA windows in your office
C00309 00120 ∂15-Jan-87 1427 MAYR@score.stanford.edu visits
C00311 00121 ∂15-Jan-87 1454 RA leaving at 4:00
C00312 00122 ∂15-Jan-87 1500 VAL
C00313 00123 ∂15-Jan-87 1545 CHEADLE@Score.Stanford.EDU Gray Tuesday
C00320 00124 ∂15-Jan-87 1555 YOUNG@Sushi.Stanford.EDU re: CS326 Grade Change
C00322 00125 ∂15-Jan-87 1557 CHEADLE@Score.Stanford.EDU Gray Tuesday
C00329 00126 ∂16-Jan-87 0814 RICHARDSON@Score.Stanford.EDU Jean-Claude Latombe
C00332 00127 ∂16-Jan-87 0958 SCHAFFER@sushi.stanford.edu Publicisizing Cole's Talk/Visit
C00334 00128 ∂16-Jan-87 1014 coraki!pratt@sun.com Mitchell on March 10
C00336 00129 ∂16-Jan-87 1039 TAJNAI@Score.Stanford.EDU Logistics of annual meeting
C00339 00130 ∂16-Jan-87 1121 coraki!pratt@sun.com Publicisizing Cole's Talk/Visit
C00342 00131 ∂16-Jan-87 1135 edsel!sunvalleymall!jlz@navajo.stanford.edu Qlisp meeting 1/23 change
C00344 00132 ∂16-Jan-87 1232 RA lunch
C00345 00133 ∂16-Jan-87 1501 LES One-page Biography
C00350 00134 ∂16-Jan-87 1656 EPPLEY@Score.Stanford.EDU Phone
C00352 00135 ∂17-Jan-87 0728 coraki!pratt@sun.com Breazu-Tannen
C00354 00136 ∂17-Jan-87 0728 SCHAFFER@sushi.stanford.edu Visits less tentative
C00356 00137 ∂17-Jan-87 0856 JJW Multilisp papers
C00357 00138 ∂17-Jan-87 1030 guibas@decwrl.dec.com next meeting, Thursday 1/22, 1:45 pm
C00359 00139 ∂17-Jan-87 1820 LES Formal Reasoning tight budget
C00364 00140 ∂17-Jan-87 2119 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00366 00141 ∂18-Jan-87 1145 JMC
C00367 00142 ∂18-Jan-87 2012 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU [Diana Wood <WOOD@SUMEX-AIM.STANFORD.EDU>: Siglunch: January 23]
C00372 00143 ∂18-Jan-87 2140 CLT
C00373 00144 ∂18-Jan-87 2334 ZABIH@Sushi.Stanford.EDU SCHEMER Talk
C00376 00145 ∂19-Jan-87 0035 edsel!bhopal!jonl@navajo.stanford.edu "Diversion" proposal
C00378 00146 ∂19-Jan-87 0035 edsel!bhopal!jonl@navajo.stanford.edu Text of the "Diversion" proposal
C00396 00147 ∂19-Jan-87 1153 SIMPSON@A.ISI.EDU Re: arrival time?
C00397 00148 ∂19-Jan-87 1238 C.CHATT@HAMLET.STANFORD.EDU FJALKDGH
C00398 00149 ∂19-Jan-87 1333 GOLUB@Score.Stanford.EDU Re: Piggott Professorship party
C00399 00150 ∂20-Jan-87 1029 CLT wics ke banquet talk
C00400 00151 ∂20-Jan-87 1252 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU Draft for Comments
C00404 00152 ∂20-Jan-87 1313 yvo@sally.utexas.edu Visiting Appointment and Woody Bledsoe
C00407 00153 ∂20-Jan-87 1356 RA telex from Imperial College
C00408 00154 ∂20-Jan-87 1438 JJW Comments on message-passing proposal
C00410 00155 ∂20-Jan-87 1639 M.MRIZEK@LEAR.STANFORD.EDU LOTS 10th Birthday Celebration
C00412 00156 ∂21-Jan-87 1308 RA Orlov's visit
C00413 00157 ∂21-Jan-87 1313 RICHARDSON@Score.Stanford.EDU Binford
C00414 00158 ∂21-Jan-87 1341 TAJNAI@Score.Stanford.EDU Hertz Fellowship
C00416 00159 ∂21-Jan-87 1405 MAYR@score.stanford.edu Richard Cole visiting
C00419 00160 ∂21-Jan-87 1412 MAYR@score.stanford.edu Joel Friedman visiting
C00421 00161 ∂21-Jan-87 1436 JJW Re: Hertz Fellowship
C00422 00162 ∂21-Jan-87 1442 busalacc@umn-cs
C00424 00163 ∂21-Jan-87 1505 ullman@navajo.stanford.edu Area X QUAL
C00426 00164 ∂21-Jan-87 1505 RICHARDSON@Score.Stanford.EDU Annual Faculty Report
C00427 00165 ∂21-Jan-87 1536 TAJNAI@Score.Stanford.EDU Re: Hertz Fellowship
C00429 00166 ∂21-Jan-87 1654 WIEDERHOLD@Score.Stanford.EDU industrial visitors
C00430 00167 ∂21-Jan-87 1748 ZABIH@Sushi.Stanford.EDU SCHEMER Talk
C00432 00168 ∂21-Jan-87 1754 NILSSON@Score.Stanford.EDU your cv
C00434 00169 ∂21-Jan-87 1841 ROBERTS@Sushi.Stanford.EDU re: SERC probation report!
C00435 00170 ∂21-Jan-87 2134 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C00438 00171 ∂22-Jan-87 0042 CLT This week's Qlisp meeting
C00439 00172 ∂22-Jan-87 0647 GOLUB@Score.Stanford.EDU re: Piggott Professorship party
C00440 00173 ∂22-Jan-87 0736 RICHARDSON@Score.Stanford.EDU re: Binford
C00441 00174 ∂22-Jan-87 0800 JMC
C00442 00175 ∂22-Jan-87 0900 JMC
C00443 00176 ∂22-Jan-87 0941 PHY
C00444 00177 ∂22-Jan-87 1051 RA NSF
C00445 00178 ∂22-Jan-87 1059 RA be back
C00446 00179 ∂22-Jan-87 1331 RA leaving early
C00447 00180 ∂22-Jan-87 1358 ROBERTS@Sushi.Stanford.EDU Re: Professorship in environmental engineering
C00449 00181 ∂22-Jan-87 1456 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: Fighting chance: ten feet to survival.
C00451 00182 ∂22-Jan-87 1613 CRISPIN@SUMEX-AIM.STANFORD.EDU re: Fighting chance: ten feet to survival.
C00455 00183 ∂22-Jan-87 1823 LES re: reviving Dialnet
C00457 00184 ∂22-Jan-87 2231 SOWA@IBM.COM Industrial lectureship for fall quarter, 1987
C00460 00185 ∂23-Jan-87 0129 binford@whitney.stanford.edu your cv
C00462 00186 ∂23-Jan-87 1058 RA telephones
C00463 00187 ∂23-Jan-87 1247 guibas@decwrl.dec.com meeting of 1/22, action items
C00465 00188 ∂23-Jan-87 1302 WIEDERHOLD@SUMEX-AIM.STANFORD.EDU Re: Industrial lectureship for fall quarter, 1987
C00466 00189 ∂23-Jan-87 1415 NILSSON@Score.Stanford.EDU [Jeff Ullman <ullman@navajo.stanford.edu>: UG AI course]
C00471 00190 ∂23-Jan-87 1619 RA leaving
C00472 00191 ∂25-Jan-87 1210 RA [Reply to message recvd: 23 Jan 87 23:30 Pacific Time]
C00473 00192 ∂25-Jan-87 2136 @SUMEX-AIM.STANFORD.EDU:Acuff@KSL-EXP-1 re: Pool machine etiquette reminder
C00475 00193 ∂26-Jan-87 0825 RA Binford
C00476 00194 ∂26-Jan-87 0830 JMC
C00477 00195 ∂26-Jan-87 0923 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
C00479 00196 ∂26-Jan-87 0930 JMC
C00480 00197 ∂26-Jan-87 1000 JMC
C00481 00198 ∂26-Jan-87 0959 RA Prof. Denoon
C00482 00199 ∂26-Jan-87 1156 JUSTESON@Sushi.Stanford.EDU meeting time
C00484 00200 ∂26-Jan-87 1219 SJG circ'n question
C00486 00201 ∂26-Jan-87 1405 VAL re: circ'n question
C00488 00202 ∂26-Jan-87 1434 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00491 00203 ∂26-Jan-87 1606 RA [Reply to message recvd: 23 Jan 87 17:20 Pacific Time]
C00492 00204 ∂26-Jan-87 1739 rms@prep.ai.mit.edu GNU EMACS
C00495 00205 ∂26-Jan-87 1834 tah@linz.stanford.edu Macsyma-manual
C00496 00206 ∂27-Jan-87 0945 CLT This week's Qlisp meeting
C00497 00207 ∂27-Jan-87 0957 RESTIVO@Score.Stanford.EDU 91 function
C00498 00208 ∂27-Jan-87 0943 RA Binford
C00499 00209 ∂27-Jan-87 1048 RA will be back
C00500 00210 ∂27-Jan-87 1332 LES Final Report on DARPA Equipment Contract
C00502 00211 ∂27-Jan-87 1350 RA
C00503 00212 ∂27-Jan-87 1532 CLT
C00504 00213 ∂27-Jan-87 1819 RESTIVO@Score.Stanford.EDU re: 91 function
C00505 00214 ∂27-Jan-87 1847 LES XPART spooling
C00506 00215 ∂27-Jan-87 1956 BSCOTT@Score.Stanford.EDU Rutie
C00507 00216 ∂28-Jan-87 0835 RA Barton Bernstein
C00508 00217 ∂28-Jan-87 0853 RA hoter.xgp
C00509 00218 ∂28-Jan-87 0901 RA hoter.xgp
C00510 00219 ∂28-Jan-87 0913 ULLMAN@Score.Stanford.EDU Ramakrishnan visit
C00512 00220 ∂28-Jan-87 0934 RA Judith Lemon
C00513 00221 ∂28-Jan-87 0958 BSCOTT@Score.Stanford.EDU [Rutie Adler <RA@SAIL.STANFORD.EDU>: my schedule ]
C00516 00222 ∂28-Jan-87 1006 RA hoter.xgp (again)
C00517 00223 ∂28-Jan-87 1110 EPPLEY@Score.Stanford.EDU New phone
C00519 00224 ∂28-Jan-87 1127 EPPLEY@Score.Stanford.EDU re: New phone
C00520 00225 ∂28-Jan-87 1508 RA hoter file
C00521 00226 ∂28-Jan-87 1552 RA bookstore
C00522 00227 ∂28-Jan-87 1733 LES CSDCF/LOTS
C00525 00228 ∂28-Jan-87 1754 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C00532 00229 ∂29-Jan-87 0813 RA
C00533 00230 ∂29-Jan-87 1034 RA Re: unprotect
C00534 00231 ∂29-Jan-87 1530 RA leaving
C00535 00232 ∂30-Jan-87 0827 EPPLEY@Score.Stanford.EDU Rutie
C00536 00233 ∂30-Jan-87 0829 BSCOTT@Score.Stanford.EDU Work Schedule
C00538 00234 ∂30-Jan-87 0901 JMC
C00539 00235 ∂30-Jan-87 0901 JMC
C00541 00236 ∂30-Jan-87 1344 HEGARTY@Score.Stanford.EDU Emacs
C00542 00237 ∂30-Jan-87 1403 VAL
C00543 00238 ∂30-Jan-87 1458 JJW Hertz renewal
C00544 00239 ∂30-Jan-87 1344 RICHARDSON@Score.Stanford.EDU Saul Amarel
C00545 00240 ∂30-Jan-87 1709 TAJNAI@Score.Stanford.EDU Important Message
C00548 00241 ∂30-Jan-87 1711 BSCOTT@Score.Stanford.EDU Rutie
C00550 00242 ∂30-Jan-87 1732 TAJNAI@Score.Stanford.EDU re: Important Message
C00552 00243 ∂31-Jan-87 0927 RPG Diversion
C00553 00244 ∂31-Jan-87 1017 CLT
C00554 00245 ∂31-Jan-87 1416 TAJNAI@Score.Stanford.EDU re: Important Message
C00556 00246 ∂31-Jan-87 1753 LES
C00557 00247 ∂01-Feb-87 0839 NILSSON@Score.Stanford.EDU student reps
C00559 00248 ∂01-Feb-87 1212 RPG diversion
C00560 00249 ∂01-Feb-87 1238 TAJNAI@Score.Stanford.EDU re: Important Message
C00562 00250 ∂01-Feb-87 1513 RLG learning
C00563 00251 ∂01-Feb-87 1604 binford@whitney.stanford.edu student reps
C00565 00252 ∂01-Feb-87 2117 ME Prancing Pony Bill
C00567 00253 ∂01-Feb-87 2204 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: student reps
C00569 00254 ∂02-Feb-87 0900 JMC
C00570 00255 ∂02-Feb-87 0931 WINOGRAD@CSLI.Stanford.EDU Re: student reps
C00571 00256 ∂02-Feb-87 0942 BUCHANAN@SUMEX-AIM.STANFORD.EDU Re: student reps
C00573 00257 ∂02-Feb-87 0957 BSCOTT@Score.Stanford.EDU Benefits Information
C00575 00258 ∂02-Feb-87 1020 TAJNAI@Score.Stanford.EDU Visit from Los Alamos
C00581 00259 ∂02-Feb-87 1209 RLG learning
C00583 00260 ∂02-Feb-87 1209 RLG winograd
C00585 00261 ∂02-Feb-87 1218 TAJNAI@Score.Stanford.EDU Last minute reminders
C00587 00262 ∂02-Feb-87 1307 TAJNAI@Score.Stanford.EDU [Dick Gabriel <RPG@SAIL.STANFORD.EDU>: Presentation ]
C00589 00263 ∂02-Feb-87 1416 VAL
C00590 00264 ∂02-Feb-87 1515 RLG winograd
C00591 00265 ∂02-Feb-87 1733 NILSSON@Score.Stanford.EDU robotics
C00594 00266 ∂02-Feb-87 1800 WINOGRAD@CSLI.Stanford.EDU Re: robotics
C00595 00267 ∂02-Feb-87 2300 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: robotics
C00597 00268 ∂03-Feb-87 0731 NILSSON@Score.Stanford.EDU cs520
C00600 00269 ∂03-Feb-87 0926 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: cs520
C00603 00270 ∂03-Feb-87 0931 WINOGRAD@CSLI.Stanford.EDU Re: cs520
C00605 00271 ∂03-Feb-87 0949 RA LA trip
C00606 00272 ∂03-Feb-87 1012 coraki!pratt@sun.com Mitchell on March 10
C00608 00273 ∂03-Feb-87 1023 ullman@navajo.stanford.edu Maley
C00610 00274 ∂03-Feb-87 1025 ullman@navajo.stanford.edu Raghu Ramakrishnan
C00612 00275 ∂03-Feb-87 1153 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00614 00276 ∂03-Feb-87 1259 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: Accuracy in Academia
C00617 00277 ∂03-Feb-87 1340 berglund@pescadero.stanford.edu Accuracy in Academia
C00619 00278 ∂03-Feb-87 1343 G.GVOZDEV@LEAR.STANFORD.EDU Re: Accuracy in Academia
C00621 00279 ∂03-Feb-87 1448 gana@sonoma.stanford.edu
C00622 00280 ∂03-Feb-87 1506 pae@shasta.stanford.edu Re: Accuracy in Academia
C00624 00281 ∂03-Feb-87 1526 ullman@navajo.stanford.edu Raghu R.
C00625 00282 ∂03-Feb-87 1538 RA Diane Moser
C00626 00283 ∂03-Feb-87 1540 PHY
C00629 00284 ∂03-Feb-87 1610 PHY Re:Goldberg
C00631 00285 ∂03-Feb-87 1620 NILSSON@Score.Stanford.EDU New DEC Project
C00634 00286 ∂03-Feb-87 1620 PAPA@score.stanford.edu New candidates
C00636 00287 ∂03-Feb-87 1733 VAL movie
C00637 00288 ∂03-Feb-87 1822 ILAN@Score.Stanford.EDU Accuracy in Academia
C00638 00289 ∂03-Feb-87 2210 CLT This week's Qlisp meeting
C00639 00290 ∂04-Feb-87 0638 coraki!pratt@sun.com Mitchell talk time change
C00641 00291 ∂04-Feb-87 0955 RA
C00642 00292 ∂04-Feb-87 1047 JIMENEZ@Score.Stanford.EDU Robert Smith
C00644 00293 ∂04-Feb-87 1055 RA
C00645 00294 ∂04-Feb-87 1753 HOBBS@SRI-WARBUCKS.ARPA A long story
C00646 00295 ∂05-Feb-87 0835 RA Work schedule
C00648 00296 ∂05-Feb-87 0837 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU [<IRA@uwafrodo.bitnet>: AIM Workshop 1987]
C00660 00297 ∂05-Feb-87 0924 PERLAKI@Score.Stanford.EDU messages
C00662 00298 ∂05-Feb-87 0926 BSCOTT@Score.Stanford.EDU Re: Work schedule
C00664 00299 ∂05-Feb-87 0935 RPG Qlisp meeting tomorrow
C00666 00300 ∂05-Feb-87 1000 JMC
C00667 00301 ∂05-Feb-87 1006 RLG question
C00673 00302 ∂05-Feb-87 1022 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C00675 00303 ∂05-Feb-87 1102 ROSENBLOOM@SUMEX-AIM.STANFORD.EDU Re: cs520
C00678 00304 ∂05-Feb-87 1130 JMC
C00679 00305 ∂05-Feb-87 1345 LES re: Qlisp meeting tomorrow
C00680 00306 ∂05-Feb-87 1419 RPG
C00681 00307 ∂05-Feb-87 1901 RIVIN@Score.Stanford.EDU Connection machine access
C00686 00308 ∂06-Feb-87 1028 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00689 00309 ∂06-Feb-87 1440 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
C00690 00310 ∂06-Feb-87 2100 JMC
C00691 00311 ∂07-Feb-87 1005 CLT calendar item
C00693 00312 ∂07-Feb-87 1907 VAL re: proposal
C00694 00313 ∂08-Feb-87 1114 RPG History Question
C00695 00314 ∂08-Feb-87 2247 CLT hp28c
C00702 00315 ∂09-Feb-87 0453 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Re: visit
C00705 00316 ∂09-Feb-87 0547 @wiscvm.wisc.edu:yoav@wisdom.bitnet housing
C00707 00317 ∂09-Feb-87 0606 @VERMITHRAX.SCH.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM Fighting Chance
C00710 00318 ∂09-Feb-87 1315 Mailer failed mail returned
C00712 00319 ∂09-Feb-87 1341 VAL reply to message
C00715 00320 ∂10-Feb-87 0843 STEINBERGER@SRI-KL.ARPA Re: Trustees meeting
C00719 00321 ∂10-Feb-87 0931 JJW Mail to Symbolics
C00720 00322 ∂10-Feb-87 1028 RICHARDSON@Score.Stanford.EDU Sr. Faculty Meeting
C00722 00323 ∂10-Feb-87 1458 guibas@decwrl.dec.com it's time for another meeting
C00724 00324 ∂10-Feb-87 1531 HOLDEN@CSLI.Stanford.EDU Re: Trustees meeting
C00726 00325 ∂10-Feb-87 1543 RA
C00727 00326 ∂10-Feb-87 1604 RA
C00728 00327 ∂10-Feb-87 1608 VAL
C00729 00328 ∂10-Feb-87 1725 HSU@Score.Stanford.EDU [Claire Stager <STAGER@Score.Stanford.EDU>: Re: grade change cards]
C00732 00329 ∂10-Feb-87 1959 GOLUB@Score.Stanford.EDU honors
C00734 00330 ∂10-Feb-87 2258 coraki!pratt@Sun.COM chair
C00735 00331 ∂10-Feb-87 2315 binford@whitney.stanford.edu congratulations
C00736 00332 ∂11-Feb-87 0902 cheriton@pescadero.stanford.edu Congrats.
C00737 00333 ∂11-Feb-87 0904 G.GORIN@OTHELLO.STANFORD.EDU Congratulations!
C00738 00334 ∂11-Feb-87 0906 CRISPIN@SUMEX-AIM.STANFORD.EDU congratulations
C00740 00335 ∂11-Feb-87 0912 RA Binford file
C00741 00336 ∂11-Feb-87 1000 CLT This week's Qlisp meeting
C00742 00337 ∂11-Feb-87 1015 DEK hearty congratulations
C00743 00338 ∂11-Feb-87 1119 DAVIES@Sierra.Stanford.EDU Los Alamos visit
C00744 00339 ∂11-Feb-87 1116 RA Sarah's charge to your American Express
C00745 00340 ∂11-Feb-87 1134 RA lunch time today
C00746 00341 ∂11-Feb-87 1203 AMEHTA@Sushi.Stanford.EDU Subst
C00750 00342 ∂11-Feb-87 1321 guibas@decwrl.dec.com meeting postponed to Tuesday, 2/17
C00752 00343 ∂11-Feb-87 1358 GROSOF@Score.Stanford.EDU congratulations!
C00753 00344 ∂11-Feb-87 1455 RA not feeling well
C00754 00345 ∂11-Feb-87 1757 GUPTA@Sushi.Stanford.EDU
C00756 00346 ∂12-Feb-87 0810 STEINBERGER@SRI-KL.ARPA Re: Platoon
C00760 00347 ∂12-Feb-87 0816 STAGER@Score.Stanford.EDU Re: grade change
C00762 00348 ∂12-Feb-87 0909 RA [Reply to message recvd: 11 Feb 87 15:08 Pacific Time]
C00763 00349 ∂12-Feb-87 1107 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C00766 00350 ∂12-Feb-87 1211 RA telephone
C00767 00351 ∂12-Feb-87 1446 RA Frank Dina Bolla
C00768 00352 ∂12-Feb-87 1650 RDZ@Sushi.Stanford.EDU SCHEMER Paper
C00770 00353 ∂13-Feb-87 0900 JMC
C00771 00354 ∂13-Feb-87 0949 CLT
C00772 00355 ∂13-Feb-87 1119 RA medical appointment
C00773 00356 ∂14-Feb-87 1515 LES re: wrong bboard
C00774 00357 ∂14-Feb-87 1905 LES
C00775 00358 ∂14-Feb-87 1920 LES "Oops" messages
C00776 00359 ∂14-Feb-87 2129 GOLDBERG@CSLI.Stanford.EDU Re: South Africa
C00779 00360 ∂14-Feb-87 2330 GOLDBERG@CSLI.Stanford.EDU And just how bad are they?
C00790 00361 ∂15-Feb-87 0204 GOLDBERG@CSLI.Stanford.EDU Re: South Africa
C00795 00362 ∂15-Feb-87 0900 JMC
C00797 00363 ∂15-Feb-87 1459 NILSSON@Score.Stanford.EDU cs520
C00801 00364 ∂15-Feb-87 1624 RESTIVO@Score.Stanford.EDU
C00803 00365 ∂15-Feb-87 1823 RESTIVO@Score.Stanford.EDU re: SAIL and Score accounts
C00804 00366 ∂15-Feb-87 2259 LES re: SAIL and Score accounts
C00805 00367 ∂15-Feb-87 2313 LES re: Community service
C00807 00368 ∂16-Feb-87 1301 HSU@Sushi.Stanford.EDU infomation
C00808 00369 ∂16-Feb-87 1306 HSU@Sushi.Stanford.EDU re: infomation
C00809 00370 ∂16-Feb-87 1601 mogul@decwrl.DEC.COM Necklacing
C00811 00371 ∂16-Feb-87 1721 guibas@decwrl.dec.com reminder: meeting tomorrow at 4:00 in mjh 352
C00813 00372 ∂16-Feb-87 1940 GOLDBERG@CSLI.Stanford.EDU mail
C00815 00373 ∂16-Feb-87 1951 CLT soup
C00816 00374 ∂17-Feb-87 0831 RICHARDSON@SCORE.STANFORD.EDU Faculty Meeting
C00818 00375 ∂17-Feb-87 1104 NILSSON@Score.Stanford.EDU winograd letter
C00820 00376 ∂17-Feb-87 1125 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU [The Mailer Daemon <Mailer@SUMEX-AIM.STANFORD.EDU>: Message of 11-Feb-87 10:55:41]
C00824 00377 ∂17-Feb-87 1130 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab email addresses
C00826 00378 ∂17-Feb-87 1300 RIVIN@Score.Stanford.EDU the squires connection
C00827 00379 ∂17-Feb-87 1310 RA Haley
C00828 00380 ∂17-Feb-87 1447 BERG@Score.Stanford.EDU 1987/88 schedule
C00830 00381 ∂17-Feb-87 1731 BRINK@Sushi.Stanford.EDU Term Papers
C00832 00382 ∂17-Feb-87 1838 guibas@decwrl.dec.com action items, meeting of 2/17
C00834 00383 ∂18-Feb-87 0107 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00838 00384 ∂18-Feb-87 0400 goldberg@russell.stanford.edu Re: Agreeing with Chomsky's politics
C00841 00385 ∂18-Feb-87 0400 goldberg@russell.stanford.edu Re: su-etc
C00843 00386 ∂18-Feb-87 1047 MAYR@score.stanford.edu Joel Friedman's schedule
C00845 00387 ∂18-Feb-87 1053 guibas@decwrl.dec.com Suri
C00847 00388 ∂18-Feb-87 1252 PAPA@score.stanford.edu Natarajan
C00848 00389 ∂18-Feb-87 1351 CLT This week's Qlisp meeting
C00849 00390 ∂18-Feb-87 1357 SCHAFFER@sushi.stanford.edu Summary of Visits
C00851 00391 ∂18-Feb-87 1415 RA don't feel well
C00852 00392 ∂18-Feb-87 1515 VAL re: proposal
C00853 00393 ∂18-Feb-87 2316 coraki!pratt@sun.com Mitchell schedule
C00855 00394 ∂19-Feb-87 0611 @wiscvm.wisc.edu:dwork@ALMVMA.BITNET
C00856 00395 ∂19-Feb-87 0914 CHIU@Sushi.Stanford.EDU re: ROC
C00858 00396 ∂19-Feb-87 0915 RICHARDSON@Score.Stanford.EDU Binford
C00859 00397 ∂19-Feb-87 0945 PHY@sail.stanford.edu
C00861 00398 ∂19-Feb-87 1015 ULLMAN@score.stanford.edu [avg@NEWTOWNE-VARIETY.LCS.MIT.EDU (Andrew V. Goldberg): Re: Another Stanford visit?]
C00864 00399 ∂19-Feb-87 1018 MAYR@score.stanford.edu Joel Friedman visit today cancelled
C00866 00400 ∂19-Feb-87 1034 coraki!pratt@sun.com Mitchell schedule
C00868 00401 ∂19-Feb-87 1109 MAYR@score.stanford.edu rescheduling J. Friedman's visit
C00870 00402 ∂19-Feb-87 1215 RA bag
C00871 00403 ∂19-Feb-87 1249 PHY@sail.stanford.edu
C00873 00404 ∂19-Feb-87 1340 RA bag (again)
C00874 00405 ∂19-Feb-87 1350 RA be back
C00875 00406 ∂19-Feb-87 1523 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU Program Committee Reception
C00877 00407 ∂19-Feb-87 1554 JUSTESON@Sushi.Stanford.EDU Machine Learning book
C00878 00408 ∂19-Feb-87 1609 RA leaving
C00879 00409 ∂20-Feb-87 0900 JMC
C00880 00410 ∂20-Feb-87 0900 JMC
C00881 00411 ∂20-Feb-87 0912 @REAGAN.AI.MIT.EDU:TLP@OZ.AI.MIT.EDU Luggage
C00883 00412 ∂20-Feb-87 1030 JMC
C00884 00413 ∂20-Feb-87 1108 WINOGRAD@CSLI.Stanford.EDU home terminal paper
C00885 00414 ∂20-Feb-87 1126 VAL proposal
C00886 00415 ∂20-Feb-87 1139 EPPLEY@Score.Stanford.EDU Phone
C00887 00416 ∂20-Feb-87 1144 RA your telephone
C00888 00417 ∂20-Feb-87 1140 VAL computers in the USSR
C00890 00418 ∂20-Feb-87 1203 RA Vacation
C00891 00419 ∂20-Feb-87 1317 VAL Grosof
C00892 00420 ∂20-Feb-87 1340 BSCOTT@Score.Stanford.EDU [ken down <HK.KSD@forsythe.stanford.edu>:]
C00895 00421 ∂20-Feb-87 1353 EPPLEY@Score.Stanford.EDU phones
C00897 00422 ∂20-Feb-87 1411 VAL
C00898 00423 ∂20-Feb-87 1913 KIRSH%OZ.AI.MIT.EDU@MC.LCS.MIT.EDU AAAI workshop on Foundations
C00899 00424 ∂22-Feb-87 0900 JMC
C00900 00425 ∂22-Feb-87 0900 JMC
C00901 00426 ∂22-Feb-87 0929 NILSSON@Score.Stanford.EDU Re: library keys
C00902 00427 ∂22-Feb-87 2146 CLT
C00903 00428 ∂23-Feb-87 0535 GROSOF@Score.Stanford.EDU recommendation and discussion
C00907 00429 ∂23-Feb-87 0833 ULLMAN@score.stanford.edu Andy Goldberg
C00909 00430 ∂23-Feb-87 0930 KHOWARD@Score.Stanford.EDU message
C00910 00431 ∂23-Feb-87 0943 AI.WOODY@MCC.COM [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
C00934 00432 ∂23-Feb-87 1045 BSCOTT@Score.Stanford.EDU Resignation letter, Rutie
C00936 00433 ∂23-Feb-87 1047 VAL Commonsense and Nonmonotonic Reasoning Seminar
C00938 00434 ∂23-Feb-87 1131 ZM
C00942 00435 ∂23-Feb-87 1134 ZM
C00946 00436 ∂23-Feb-87 1207 WINOGRAD@CSLI.Stanford.EDU home terminal essay
C00947 00437 ∂23-Feb-87 1357 WINOGRAD@CSLI.Stanford.EDU re: home terminal essay
C00948 00438 ∂23-Feb-87 1427 WOODWARD@Score.Stanford.EDU Network Connection Charges
C00950 00439 ∂23-Feb-87 1516 RA Trip to Anchorage and Japan
C00951 00440 ∂23-Feb-87 1623 VAL workshop on the frame problem
C00952 00441 ∂23-Feb-87 1655 JJW Re: Alex Nicolau - Student Session
C00954 00442 ∂23-Feb-87 1827 RA Coming in late tomorrow
C00955 00443 ∂23-Feb-87 2208 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
C00957 00444 ∂23-Feb-87 2249 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: NAE election
C00959 00445 ∂24-Feb-87 0703 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Your schedule in Tokyo
C00962 00446 ∂24-Feb-87 0822 SCHAFFER@sushi.stanford.edu Revised Visit Schedule
C00965 00447 ∂24-Feb-87 0832 SCHAFFER@sushi.stanford.edu Time of Goldberg's talk
C00966 00448 ∂24-Feb-87 0900 JMC
C00967 00449 ∂24-Feb-87 0916 ullman@navajo.stanford.edu Re: Revised Visit Schedule
C00968 00450 ∂24-Feb-87 1001 RA
C00970 00451 ∂24-Feb-87 1001 OKUNO@SUMEX-AIM.STANFORD.EDU
C00972 00452 ∂24-Feb-87 1313 NILSSON@Score.Stanford.EDU Re: algebraic computation
C00974 00453 ∂24-Feb-87 1437 RA ok for AX charges
C00975 00454 ∂24-Feb-87 1550 RA CS258
C00976 00455 ∂24-Feb-87 1739 guibas@decwrl.dec.com foundation search meetings
C00979 00456 ∂24-Feb-87 2106 RIVIN@Score.Stanford.EDU Re: algebraic computation
C00980 00457 ∂24-Feb-87 2247 coraki!pratt@sun.com Mitchell talk
C00983 00458 ∂24-Feb-87 2248 coraki!pratt@Sun.COM re: Diagramming: An Educational Anachronism?
C00986 00459 ∂25-Feb-87 0946 CLT This week's Qlisp meeting
C00987 00460 ∂25-Feb-87 1047 KHOWARD@Score.Stanford.EDU message
C00988 00461 ∂25-Feb-87 1331 guibas@decwrl.dec.com time for the meetings
C00990 00462 ∂25-Feb-87 1423 CLT ut
C00991 00463 ∂25-Feb-87 1501 NILSSON@Score.Stanford.EDU Annual Reports
C00993 00464 ∂25-Feb-87 1541 WINOGRAD@CSLI.Stanford.EDU CC of letter I sent to Spanish professor
C00995 00465 ∂25-Feb-87 1700 JMC
C00997 00466 ∂25-Feb-87 1833 ZM Re: Workshop
C01001 00467 ∂25-Feb-87 2220 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU biblio. ref.
C01004 00468 ∂26-Feb-87 0024 ILAN@Score.Stanford.EDU re: Go programs
C01006 00469 ∂26-Feb-87 0114 helen@Psych.Stanford.EDU Liberal biases
C01010 00470 ∂26-Feb-87 0727 COWER@CSLI.Stanford.EDU re: parking tickets
C01012 00471 ∂26-Feb-87 0813 RA Re: Please phone
C01013 00472 ∂26-Feb-87 0900 JMC
C01014 00473 ∂26-Feb-87 0900 JMC
C01015 00474 ∂26-Feb-87 0958 CLT
C01016 00475 ∂26-Feb-87 1009 RLG PhD programs
C01017 00476 ∂26-Feb-87 1140 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
C01019 00477 ∂26-Feb-87 1533 RA leaving at 4:00
C01020 00478 ∂26-Feb-87 1536 MAYR@score.stanford.edu Joel Friedman's schedule
C01022 00479 ∂26-Feb-87 2055 CLT please
C01024 00480 ∂27-Feb-87 0822 MAZZETTI@SUMEX-AIM.STANFORD.EDU lunch
C01033 00481 ∂27-Feb-87 0900 JMC
C01034 00482 ∂27-Feb-87 0959 @Score.Stanford.EDU:WALESON@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
C01037 00483 ∂27-Feb-87 1023 CLT ut reply
C01039 00484 ∂27-Feb-87 1208 RA going home
C01040 00485 ∂27-Feb-87 1402 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
C01042 00486 ∂27-Feb-87 1457 VAL random fault
C01044 00487 ∂27-Feb-87 1505 WENTWORTH@Sierra.Stanford.EDU Re: aids
C01046 00488 ∂27-Feb-87 1517 JUTTA@Score.Stanford.EDU MS Admissions folders
C01048 00489 ∂27-Feb-87 1521 VAL darpa proposal
C01049 00490 ∂27-Feb-87 1534 VAL elephant
C01050 00491 ∂27-Feb-87 2059 OKUNO@SUMEX-AIM.STANFORD.EDU Abstract of Hibino's talk
C01054 00492 ∂27-Feb-87 2113 OKUNO@SUMEX-AIM.STANFORD.EDU Your visit to Japan
C01057 00493 ∂28-Feb-87 0702 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Re: Tokyo visits
C01059 00494 ∂28-Feb-87 1027 CLT Special seminar - VLSI and ELIS Lisp Machine
C01062 00495 ∂28-Feb-87 1548 WATSON@Sushi.Stanford.EDU Re: SJSU
C01067 00496 ∂28-Feb-87 2327 helen@Psych.Stanford.EDU Re: sex differences and public policy
C01069 00497 ∂01-Mar-87 0042 RFC Prancing Pony Bill
C01071 00498 ∂01-Mar-87 0900 JMC
C01072 00499 ∂01-Mar-87 0900 JMC
C01073 00500 ∂01-Mar-87 1135 NILSSON@Score.Stanford.EDU
C01075 00501 ∂01-Mar-87 1307 HANSEN@Sierra.Stanford.EDU Breakin to your account on ibmrtpc1.
C01078 00502 ∂01-Mar-87 1308 HANSEN@Sierra.Stanford.EDU Log of breakin on ibmrtpc1
C01104 00503 ∂01-Mar-87 1407 HANSEN@Sierra.Stanford.EDU re: Breakin to your account on ibmrtpc1.
C01106 00504 ∂01-Mar-87 1429 VAL re: proposal
C01107 00505 ∂01-Mar-87 1440 VAL Commonsense and Nonmonotonic Reasoning Seminar
C01108 00506 ∂01-Mar-87 2224 RWF reply to message
C01110 00507 ∂02-Mar-87 1057 bleiberg@argus.stanford.edu Re: whois database
C01112 00508 ∂02-Mar-87 1337 WEGMAN@yktvmh2.bitnet Visit
C01113 00509 ∂02-Mar-87 1346 CERF@A.ISI.EDU NAE
C01115 00510 ∂02-Mar-87 1355 CLT
C01117 00511 ∂02-Mar-87 1547 KONOLIGE@SRI-WARBUCKS.ARPA Re: random fault
C01119 00512 ∂02-Mar-87 1632 @po3.andrew.cmu.edu:lb0q#@andrew.cmu.edu AAAI workshop funding
C01121 00513 ∂02-Mar-87 1818 Mailer failed mail returned
C01125 00514 ∂02-Mar-87 1820 LES re: nic database
C01126 00515 ∂02-Mar-87 2159 guibas@navajo.stanford.edu foundations search meetings: when and where
C01127 00516 ∂03-Mar-87 0900 JMC
C01128 00517 ∂03-Mar-87 1003 coraki!pratt@sun.com Mitchell schedule
C01130 00518 ∂03-Mar-87 1037 RICHARDSON@Score.Stanford.EDU Binford
C01131 00519 ∂03-Mar-87 1124 MAYR@score.stanford.edu joel friedman's schedule
C01133 00520 ∂03-Mar-87 1151 RIVIN@Score.Stanford.EDU Re: algebraic computation
C01135 00521 ∂03-Mar-87 1214 RIVIN@Score.Stanford.EDU Re: algebraic computation
C01138 00522 ∂03-Mar-87 1322 RICHARDSON@Score.Stanford.EDU Faculty Meeting
C01140 00523 ∂03-Mar-87 1331 guibas@navajo.stanford.edu whole faculty meeting for foundations appointments
C01142 00524 ∂03-Mar-87 1332 RICHARDSON@Score.Stanford.EDU Faculty Meeting
C01144 00525 ∂03-Mar-87 1531 RA Virginia Mann
C01145 00526 ∂03-Mar-87 1707 RA article about AI
C01147 00527 ∂04-Mar-87 0858 JMC
C01148 00528 ∂04-Mar-87 0910 SIEGMAN@Sierra.Stanford.EDU Faculty AIDS Cases
C01151 00529 ∂04-Mar-87 1115 GCOLE@Sushi.Stanford.EDU re: Removing Reagan
C01153 00530 ∂04-Mar-87 1231 RA pictures
C01154 00531 ∂04-Mar-87 1254 LES Proposed loan agreement with Computer Museum
C01160 00532 ∂04-Mar-87 1312 guibas@decwrl.dec.com final Subhash Suri schedule
C01163 00533 ∂04-Mar-87 1556 CLT This week's Qlisp meeting
C01164 00534 ∂04-Mar-87 1605 LES Formal Reasoning Budget
C01173 00535 ∂04-Mar-87 1644 rosenberg%hplsr@hplabs.HP.COM Procedure for volunteering to organize a workshop
C01177 00536 ∂04-Mar-87 1648 WIEDERHOLD@Score.Stanford.EDU Sowa
C01178 00537 ∂04-Mar-87 2117 binford@whitney.stanford.edu Proposed loan agreement with Computer Museum
C01179 00538 ∂05-Mar-87 0702 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Your visit
C01183 00539 ∂05-Mar-87 0900 JMC
C01184 00540 ∂05-Mar-87 1145 RA Ron Gatterdam
C01185 00541 ∂05-Mar-87 1357 RA Richard Schroeppel
C01187 00542 ∂05-Mar-87 1552 GINN@Sushi.Stanford.EDU CS326
C01188 00543 ∂05-Mar-87 1604 RA leaving
C01189 00544 ∂05-Mar-87 1736 RDZ@Sushi.Stanford.EDU 3600 Demonstration
C01190 00545 ∂05-Mar-87 1903 KOHEN@Sushi.Stanford.EDU Inference Corp.
C01191 00546 ∂05-Mar-87 2017 GINN@Sushi.Stanford.EDU re: CS326
C01192 00547 ∂05-Mar-87 2158 CRISPIN@SUMEX-AIM.STANFORD.EDU re: "ROC flag"-continue
C01198 00548 ∂05-Mar-87 2217 @SUMEX-AIM.STANFORD.EDU:Crispin@SUMEX-AIM.Stanford.EDU ROC, etc...
C01201 00549 ∂05-Mar-87 2232 ARIMA%icot.jp@RELAY.CS.NET On your visit to ICOT (Tokyo)
C01205 00550 ∂06-Mar-87 0900 JMC
C01206 00551 ∂06-Mar-87 1045 RA macros
C01207 00552 ∂06-Mar-87 1048 R.ROLAND@LEAR.STANFORD.EDU aids
C01210 00553 ∂06-Mar-87 1111 RA Richard Schroeppel
C01211 00554 ∂06-Mar-87 1156 PAPA@score.stanford.edu Meeting today
C01214 00555 ∂06-Mar-87 1510 SJG Taming the Shrew on Sunday
C01216 00556 ∂06-Mar-87 1652 VAL cs326 final
C01217 00557 ∂07-Mar-87 1259 JJW DIAL job
C01218 00558 ∂07-Mar-87 1325 R.ROLAND@LEAR.STANFORD.EDU aids
C01220 00559 ∂07-Mar-87 1350 JSW Futures
C01233 00560 ∂08-Mar-87 0900 JMC
C01234 00561 ∂08-Mar-87 1050 VAL proposal
C01238 00562 ∂09-Mar-87 0900 JMC
C01239 00563 ∂09-Mar-87 1023 RICHARDSON@Score.Stanford.EDU Faculty Meeting
C01241 00564 ∂09-Mar-87 1029 ULLMAN@score.stanford.edu [Baruch Schieber <sbar%TAURUS.BITNET@wiscvm.wisc.edu>:]
C01250 00565 ∂09-Mar-87 1106 VAL re: proposal
C01251 00566 ∂09-Mar-87 1123 VAL re: proposal
C01252 00567 ∂09-Mar-87 1143 RA Mitch Ross
C01253 00568 ∂09-Mar-87 1144 RA Ron Gatterdam
C01254 00569 ∂09-Mar-87 1152 PAPA@score.stanford.edu Visit by B. Natarajan
C01257 00570 ∂09-Mar-87 1201 QIAN@Score.Stanford.EDU Prof. Tang's visit
C01258 00571 ∂09-Mar-87 1213 VAL new paper on the Yale shooting
C01259 00572 ∂09-Mar-87 1406 RA Sanders
C01260 00573 ∂09-Mar-87 1434 RA be back
C01261 00574 ∂09-Mar-87 1517 MAYR@Score.Stanford.EDU new course: Topics in Algebraic Computation
C01264 00575 ∂09-Mar-87 1701 REGES@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
C01266 00576 ∂09-Mar-87 2008 NILSSON@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
C01268 00577 ∂09-Mar-87 2037 MAYR@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
C01270 00578 ∂10-Mar-87 0323 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: China
C01275 00579 ∂10-Mar-87 0358 REGES@Score.Stanford.EDU industrial lecturers
C01277 00580 ∂10-Mar-87 0401 REGES@Score.Stanford.EDU correction
C01279 00581 ∂10-Mar-87 0856 RA
C01280 00582 ∂10-Mar-87 1009 PAPA@score.stanford.edu Natarajan
C01281 00583 ∂10-Mar-87 1037 VAL Proposal
C01285 00584 ∂10-Mar-87 1206 masahiko%nttlab.ntt.junet%utokyo-relay.csnet@RELAY.CS.NET Re: trip
C01290 00585 ∂10-Mar-87 1233 VAL re: Proposal
C01291 00586 ∂10-Mar-87 1234 VAL
C01292 00587 ∂10-Mar-87 1243 CLT thursday
C01293 00588 ∂10-Mar-87 1318 PAPA@score.stanford.edu Re: Natarajan
C01295 00589 ∂10-Mar-87 1351 SJG
C01296 00590 ∂10-Mar-87 1409 AIR EBOS
C01298 00591 ∂10-Mar-87 1443 RA leaving
C01299 00592 ∂10-Mar-87 1452 VAL Non-monotonic seminar: NO MEETING this week
C01300 00593 ∂10-Mar-87 1500 VAL
C01301 00594 ∂10-Mar-87 1607 CLT soup
C01302 00595 ∂10-Mar-87 1651 L.LILITH@OTHELLO.STANFORD.EDU AIDS patients as reservoirs of infection
C01306 00596 ∂10-Mar-87 1720 BSCOTT@Score.Stanford.EDU [Betty Scott <BSCOTT@Score.Stanford.EDU>: Today]
C01309 00597 ∂10-Mar-87 1747 DLIU@Sierra.Stanford.EDU The ROC.PRC debate
C01311 00598 ∂10-Mar-87 1750 L.LILITH@OTHELLO.STANFORD.EDU B cells and T cells
C01318 00599 ∂10-Mar-87 1834 DLIU@Sierra.Stanford.EDU re: The ROC.PRC debate
C01320 00600 ∂10-Mar-87 1841 L.LILITH@OTHELLO.STANFORD.EDU re: AIDS patients as reservoirs of infection
C01326 00601 ∂10-Mar-87 1851 L.LILITH@OTHELLO.STANFORD.EDU re: AIDS patients as reservoirs of infection
C01329 00602 ∂11-Mar-87 0108 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab [ARIMA%ICOT20.ICOT@icot.icot.junet: On Prof.McCarthy]
C01333 00603 ∂11-Mar-87 0944 RA Steve Balter, Sun Microsystems
C01334 00604 ∂11-Mar-87 1024 PERLAKI@Sushi.Stanford.EDU Check
C01335 00605 ∂11-Mar-87 1111 RA meeting today
C01336 00606 ∂11-Mar-87 1301 AIR ebos
C01337 00607 ∂11-Mar-87 1418 WEGMAN@yktvmh2.bitnet Visit
C01339 00608 ∂11-Mar-87 1457 rms@PREP.AI.MIT.EDU Another Macsyma-like situation.
C01341 00609 ∂11-Mar-87 1456 CLT This week's Qlisp meeting
C01342 00610 ∂11-Mar-87 1542 RICHARDSON@Score.Stanford.EDU Course Proposal
C01344 00611 ∂11-Mar-87 1544 RA leaving
C01345 00612 ∂11-Mar-87 1546 paddstep@portia.STANFORD.EDU Eurisko...
C01346 00613 ∂11-Mar-87 1558 RICHARDSON@Score.Stanford.EDU re: Course Proposal
C01347 00614 ∂11-Mar-87 1810 LES re: Another Macsyma-like situation.
C01348 00615 ∂11-Mar-87 2325 Olasov.StudentNS@MIT-MULTICS.ARPA Common LISP mail litht
C01350 00616 ∂12-Mar-87 0838 MACMILK@Score.Stanford.EDU re: want to help name my sister's child?
C01353 00617 ∂12-Mar-87 0909 RA CS326 final
C01354 00618 ∂12-Mar-87 0955 PAPA@score.stanford.edu Natarajan
C01356 00619 ∂12-Mar-87 1123 ladyb@ratliff.cs.utexas.edu Fall Appointment (from J. C. Browne)
C01360 00620 ∂12-Mar-87 1130 JMC
C01361 00621 ∂12-Mar-87 1427 RA Your March 10th message to me
C01363 00622 ∂12-Mar-87 1547 RA leaving
C01364 00623 ∂12-Mar-87 1644 LES Formal Reasoning Final Report
C01365 00624 ∂12-Mar-87 1811 guibas@decwrl.dec.com meeting tomorrow (3/13), at 4:30 pm, mjh 301
C01367 00625 ∂12-Mar-87 2212 RPG You CheapSkate
C01368 00626 ∂13-Mar-87 0030 OKUNO@SUMEX-AIM.STANFORD.EDU Re: Futures
C01371 00627 ∂13-Mar-87 0901 JMC
C01372 00628 ∂13-Mar-87 0901 GUNNING@Sushi.Stanford.EDU Take Home final and unintended typos
C01374 00629 ∂13-Mar-87 0917 coraki!pratt@sun.com Programming Languages
C01377 00630 ∂13-Mar-87 1051 DEWERK@Score.Stanford.EDU Robert Smith
C01379 00631 ∂13-Mar-87 1111 RA leaving shortly
C01380 00632 ∂13-Mar-87 1205 cheriton@pescadero.stanford.edu Re: Programming Languages
C01382 00633 ∂13-Mar-87 1329 JUTTA@Score.Stanford.EDU MS Admissions folders
C01383 00634 ∂13-Mar-87 1336 RA Time off
C01384 00635 ∂13-Mar-87 1343 ZM workshop
C01385 00636 ∂13-Mar-87 1502 AI.CHRISSIE@R20.UTEXAS.EDU Immune System Article
C01386 00637 ∂13-Mar-87 1522 BSCOTT@Score.Stanford.EDU Re: Your March 10th message to me
C01388 00638 ∂13-Mar-87 2048 BRINK@Sushi.Stanford.EDU Job offer
C01390 00639 ∂13-Mar-87 2055 BRINK@Sushi.Stanford.EDU re: Job offer
C01391 00640 ∂14-Mar-87 1021 CLT
C01392 00641 ∂14-Mar-87 1025 SINGH@Sierra.Stanford.EDU re: Law *requiring* firearms!
C01393 00642 ∂14-Mar-87 1259 guibas@decwrl.dec.com summary of meeting, 3/13
C01396 00643 ∂14-Mar-87 1831 TEICH@Sushi.Stanford.EDU Spring financing
C01398 00644 ∂15-Mar-87 0026 RLG 326 final
C01401 00645 ∂15-Mar-87 1328 RLG re: final
C01402 00646 ∂15-Mar-87 1420 RLG typo? on final
C01403 00647 ∂15-Mar-87 1835 TEICH@Sushi.Stanford.EDU re: Spring financing
C01404 00648 ∂16-Mar-87 0727 RPG X3J13
C01405 00649 ∂16-Mar-87 0755 BSCOTT@Score.Stanford.EDU re: Performance Evaluations
C01407 00650 ∂16-Mar-87 0844 AI.BOYER@MCC.COM hi
C01409 00651 ∂16-Mar-87 1000 JMC
C01410 00652 ∂16-Mar-87 1030 WIEDERHOLD@sumex-aim.stanford.edu Re: Programming Languages
C01412 00653 ∂16-Mar-87 1108 RA David Chudnovsky
C01413 00654 ∂16-Mar-87 1202 RA David Chudnovsky
C01414 00655 ∂16-Mar-87 1329 davism@nyu-csd1.arpa
C01416 00656 ∂16-Mar-87 1337 SJG logic article
C01417 00657 ∂16-Mar-87 1418 MAYR@Score.Stanford.EDU course on interactive proof checkers etc
C01419 00658 ∂16-Mar-87 1424 LES
C01420 00659 ∂16-Mar-87 1459 TAJNAI@Score.Stanford.EDU please verify
C01422 00660 ∂16-Mar-87 1730 TAJNAI@Score.Stanford.EDU re: please verify
C01423 00661 ∂16-Mar-87 1807 PLAMBECK@Sushi.Stanford.EDU re: ``We present you now Professor Twist...''
C01425 00662 ∂16-Mar-87 1820 MAYR@Score.Stanford.EDU re: course on interactive proof checkers etc
C01427 00663 ∂16-Mar-87 2000 SCHOLZ@Sushi.Stanford.EDU Re: expert on women's gymnastic
C01429 00664 ∂16-Mar-87 2002 SCHOLZ@Sushi.Stanford.EDU Re: expert on women's gymnastic
C01431 00665 ∂17-Mar-87 0002 JACOBS@Sushi.Stanford.EDU re: Law *requiring* firearms!
C01433 00666 ∂17-Mar-87 0126 SHIH@Sushi.Stanford.EDU re: Poverty In America
C01436 00667 ∂17-Mar-87 0909 BRINK@Sushi.Stanford.EDU Meeting
C01437 00668 ∂17-Mar-87 0938 JJW AAP meeting 3/18/87 9:00am N.Osato
C01441 00669 ∂17-Mar-87 0944 CLT kyoto
C01442 00670 ∂17-Mar-87 1001 SCHOLZ@Sushi.Stanford.EDU re: expert on women's gymnastic
C01443 00671 ∂17-Mar-87 1037 CLT This week's Qlisp meeting
C01444 00672 ∂17-Mar-87 1037 BARWISE@CSLI.Stanford.EDU Undergrad course on interactive proofs
C01446 00673 ∂17-Mar-87 1224 RA leak in your house
C01447 00674 ∂17-Mar-87 1332 REGES@Score.Stanford.EDU interactive proof-checkers
C01449 00675 ∂17-Mar-87 1333 @Score.Stanford.EDU:helen@Psych.Stanford.EDU re: slugs, trees, eyes and pelicans
C01451 00676 ∂17-Mar-87 1337 AIR reply to message
C01452 00677 ∂17-Mar-87 1340 REGES@Score.Stanford.EDU addendum
C01454 00678 ∂17-Mar-87 1400 JMC
C01455 00679 ∂17-Mar-87 1905 ME Lathrop spooling
C01456 00680 ∂18-Mar-87 0733 davism@nyu-csd1.arpa Re: reply to message
C01458 00681 ∂18-Mar-87 0813 JJW visit to California
C01462 00682 ∂18-Mar-87 1142 VAL Commonsense and Nonmonotonic Reasoning Seminar
C01464 00683 ∂18-Mar-87 1224 NSH meeting
C01466 00684 ∂18-Mar-87 1235 MAYR@Score.Stanford.EDU shankar
C01467 00685 ∂18-Mar-87 1406 VAL reply to message
C01468 00686 ∂18-Mar-87 1504 SJG Symbolic support
C01469 00687 ∂18-Mar-87 1505 SJG logic paper
C01474 00688 ∂18-Mar-87 1545 CLT
C01475 00689 ∂18-Mar-87 1748 SJG re: logic paper
C01476 00690 ∂18-Mar-87 2024 JJW Halstead visit
C01477 00691 ∂19-Mar-87 0835 CLT
C01480 00692 ∂19-Mar-87 0927 RA My vacation
C01481 00693 ∂19-Mar-87 0958 MACMILK@Score.Stanford.EDU re: the newest mac millen...
C01483 00694 ∂19-Mar-87 1028 TAJNAI@Score.Stanford.EDU research interests
C01485 00695 ∂19-Mar-87 1040 RA be back
C01486 00696 ∂19-Mar-87 1420 VAL call from Mike Buckley
C01487 00697 ∂19-Mar-87 1441 COHN@Sushi.Stanford.EDU Re: Hershey's
C01489 00698 ∂19-Mar-87 1450 VAL the Lawrence workshop
C01490 00699 ∂19-Mar-87 1510 TAJNAI@Score.Stanford.EDU re: research interests
C01492 00700 ∂19-Mar-87 1551 RA leaving
C01493 00701 ∂19-Mar-87 1648 MAYR@Score.Stanford.EDU ug course, interactive proof systems
C01494 00702 ∂19-Mar-87 1800 VAL Nonmonotonic seminar
C01495 00703 ∂19-Mar-87 2257 edsel!bhopal!jonl@navajo.stanford.edu Your talk at X3J13 meeting
C01497 00704 ∂20-Mar-87 0616 coraki!pratt@sun.com Mitchell correspondence
C01501 00705 ∂20-Mar-87 0900 JMC
C01502 00706 ∂20-Mar-87 0911 CBARSALOU@Score.Stanford.EDU Re: AIDS
C01504 00707 ∂20-Mar-87 1134 RA Telex for you
C01505 00708 ∂20-Mar-87 1200 JMC
C01506 00709 ∂20-Mar-87 1349 RA short abstract
C01507 00710 ∂20-Mar-87 1749 GQ.JAN@forsythe.stanford.edu Lindy problem accessing Forsythe
C01509 00711 ∂21-Mar-87 1243 RLG PhD prog's
C01511 00712 ∂21-Mar-87 1753 SIEGMAN@Sierra.Stanford.EDU John, its "publicly" rather than "publically",
C01512 00713 ∂22-Mar-87 0948 perlis@yoohoo.cs.umd.edu papers
C01516 00714 ∂22-Mar-87 1726 LES Random Inputs
C01523 00715 ∂23-Mar-87 0932 TALEEN@Score.Stanford.EDU this week
C01525 00716 ∂23-Mar-87 1113 GINN@Sushi.Stanford.EDU
C01526 00717 ∂23-Mar-87 1427 KARTAM@Sushi.Stanford.EDU MSCS-petition proposed program
C01529 00718 ∂23-Mar-87 1631 JJW Alliant Common Lisp
C01531 00719 ∂23-Mar-87 1652 ILAN@Score.Stanford.EDU Computer Chess
C01533 00720 ∂23-Mar-87 1905 @SUMEX-AIM.STANFORD.EDU:GOTO@NTT-20 Your visit to NTT laboratories on April 2 (Thu)
C01536 00721 ∂24-Mar-87 0800 JMC
C01537 00722 ∂24-Mar-87 0905 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU [MARY%UK.AC.UMIST.CCL%UK.AC.UMIST@ac.uk: AAAI funding for workshops]
C01538 00723 ∂24-Mar-87 1117 ILAN@Score.Stanford.EDU Location of Computer Chess Demo
C01539 00724 ∂24-Mar-87 1424 VAL exams
C01543 00725 ∂25-Mar-87 0821 perlis@yoohoo.cs.umd.edu Re: How can a program mean?
C01552 00726 ∂25-Mar-87 1051 TALEEN@Score.Stanford.EDU confirmation of dr.'s appt.
C01553 00727 ∂25-Mar-87 1113 EMMA@CSLI.Stanford.EDU Invitation (CSLI)
C01555 00728 ∂25-Mar-87 1140 RLG NSF
C01556 00729 ∂25-Mar-87 1436 TEICH@Sushi.Stanford.EDU re: Spring financing
C01558 00730 ∂25-Mar-87 1512 TALEEN@Score.Stanford.EDU please call John Cate
C01559 00731 ∂25-Mar-87 1702 TALEEN@Score.Stanford.EDU tomorrow
C01560 00732 ∂25-Mar-87 2100 REGES@Score.Stanford.EDU Do we want RT's?
C01563 00733 ∂26-Mar-87 0221 REGES@Score.Stanford.EDU re: Do we want RT's?
C01564 00734 ∂26-Mar-87 0743 SCHAFFER@sushi.stanford.edu What did Dean Gibbons say...
C01565 00735 ∂26-Mar-87 0824 RPG My SAIL Account
C01566 00736 ∂26-Mar-87 0935 PAPA@score.stanford.edu Re: What did Dean Gibbons say...
C01568 00737 ∂26-Mar-87 1016 GARDNER@CSLI.Stanford.EDU An invitation
C01570 00738 ∂26-Mar-87 1018 GARDNER@CSLI.Stanford.EDU Conference program
C01585 00739 ∂26-Mar-87 1210 BARWISE@CSLI.Stanford.EDU Re: Invitation (CSLI)
C01587 00740 ∂26-Mar-87 1259 LES RPG account
C01589 00741 ∂26-Mar-87 1333 EPPLEY@Score.Stanford.EDU Taleen
C01590 00742 ∂26-Mar-87 1512 LES RWW account
C01591 00743 ∂26-Mar-87 1643 NSH Bellin/Ketonen report
C01594 00744 ∂26-Mar-87 1911 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab your visit
C01596 00745 ∂27-Mar-87 0148 TVR@CCRMA-F4
C01597 00746 ∂27-Mar-87 0822 EPPLEY@Score.Stanford.EDU Chairs
C01598 00747 ∂27-Mar-87 0830 GARDNER@CSLI.Stanford.EDU re: An invitation
C01599 00748 ∂27-Mar-87 0900 JMC
C01600 00749 ∂27-Mar-87 0955 CLT Flights
C01601 00750 ∂27-Mar-87 1013 AIR Richard Stallman
C01602 00751 ∂27-Mar-87 1031 VAL re: name
C01603 00752 ∂27-Mar-87 1042 VAL The frame problem workshop
C01609 00753 ∂27-Mar-87 1240 VAL re: The frame problem workshop
C01610 00754 ∂27-Mar-87 1340 RLG McDermott
C01611 00755 ∂27-Mar-87 1408 TALEEN@Score.Stanford.EDU Thanks for the book!
C01613 00756 ∂27-Mar-87 1428 MAYR@score.stanford.edu Joel Friedman
C01615 00757 ∂27-Mar-87 1550 WINOGRAD@Score.Stanford.EDU Paper of yours
C01616 ENDMK
C⊗;
∂01-Jan-87 1400 SJG multi-valued logics
Hi John:
(Happy New Year!)
What I didn't get to tell you when we last spoke (and I don't know if
it will interest you or not), is that something nice about the
multi-valued stuff is that it is (or at least appears to be) implementable.
I've got some very general algorithms that specialize to all sorts of
stuff, including first-order logic, ATMS's, default reasoning (a la Reiter),
chronological ignorance, and prioritized default reasoning. The
specialization appears to be pretty good, in the sense that the result
of specializing the algorithm too (say) first-order inference is the same
as just running a first-order prover; the overhead is very small.
Actually getting the algorithm to run involves storing a little bit
of information that is not conveniently stored with values from a
bilattice, but it seems to me that what you are trying to calculate
*is* the bilattice closure. So maybe we will agree, when you get to
fill in your "doubts" to me.
Anyway, there are now 3 multi-valued papers:
(1) "Multi-valued logics," which you already have,
(2) "Multi-valued inference," which describes the algorithms I mentioned
above, and
(3) "Bilattices," which has a lot of mathematical stuff I needed in (2),
but didn't want to include there.
If you're interested, I'll leave you copies. I am off to a lattice theory
workshop on Sunday, but hope we can talk either before (but I doubt it), or
when I get back.
Enjoy the holidays --
Matt
∂02-Jan-87 1056 CHANDRA%OSU-20@ohio-state.ARPA Support request for TICIP Workshop
Received: from OHIO-STATE.ARPA by SAIL.STANFORD.EDU with TCP; 2 Jan 87 10:56:34 PST
Return-Path: <CHANDRA%OSU-20@ohio-state.ARPA>
Received: from OSU-20 (osu-20.ARPA) by ohio-state.ARPA (4.12/6.1.OSU-CIS)
id AA12456; Fri, 2 Jan 87 13:54:45 est
Message-Id: <8701021854.AA12456@ohio-state.ARPA>
Date: Fri 2 Jan 87 13:56:34-EST
From: B. Chandrasekaran <Chandra%OSU-20@ohio-state.ARPA>
Subject: Support request for TICIP Workshop
To: JMC@su-ai.arpa
Cc: Chandra%OSU-20@ohio-state.ARPA
John,
A few weeks ago I had sent a request for support of the Theoretical
Issues in Conceptual Information Processing Workshop being planned in
U of Maryland for early June. Since a number of planning activities
will need to be initiated, it will be helpful to hear about AAAI support
that was requested in my ealrlier message. If the message is lost,
pl. let me know, and I'll remail my copy of it.
Thanks.
Chandrasekaran
-------
∂02-Jan-87 1453 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 2 January 1987
Previous Balance 4.25
Payment(s) 4.25 (check 12/11/86)
-------
Current Charges 4.00 (bicycle lockers)
-------
TOTAL AMOUNT DUE 4.00
Please deliver payments to Debbie Woodward, room 040, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Note: Payment recordation takes up to three weeks after delivery of a payment
(but not beyond the next billing date).
Bills are payable upon presentation. Interest of 1.0% per month will be
charged on balances remaining unpaid 25 days after bill date above.
An account with a credit balance earns interest of .33% per month,
based on the average daily balance.
∂04-Jan-87 1526 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Jan 87 15:26:20 PST
Date: Sun 4 Jan 87 15:23:40-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: Re: SERC probation report!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 30 Dec 86 17:17:00-PST
Message-ID: <12268332585.18.ROBERTS@Sushi.Stanford.EDU>
Ah, well, thank you. Hmmm, I suppose the wheels of SERC's beaurocracy
grind exceeding slow. Thanks, I'll pass it on to Nils. `probation' is
a strange turn of phrase on their part.....
Paul
-------
∂04-Jan-87 1814 @RELAY.CS.NET,@utterly.ai.toronto.edu:hector@AI.AI.MIT.EDU status report
Received: from RELAY.CS.NET by SAIL.STANFORD.EDU with TCP; 4 Jan 87 18:13:55 PST
Received: from toronto.edu by csnet-relay.csnet id ab02660; 4 Jan 87 21:12 EST
Received: from utterly.ai.toronto.edu by ai.toronto.edu id AA10276; Sun, 4 Jan 87 18:42:17 est
Received: from ai by utterly.ai.toronto.edu via ETHER with SMTP id AA02235; Sun, 4 Jan 87 18:41:09 EST
Message-Id: <8701042341.AA02235@utterly.ai.toronto.edu>
Date: 04 Jan 87 18:41:00 EST (Sun)
From: Hector Levesque <hector%ai.toronto.edu@RELAY.CS.NET>
To: james@ROCHESTER.ARPA, ec@brown, JON.DOYLE%CMU-CS-A.ARPA@RELAY.CS.NET,
jon.doyle%c.cs.cmu.edu@RELAY.CS.NET, forbus@A.CS.UIUC.EDU,
hinton%cmu-cs-a%ai.toronto.edu@RELAY.CS.NET, hobbs@SRI-WARBUCKS.ARPA,
israel@SRI-STRIPE.ARPA, jmc@SU-AI.ARPA, val@SU-AI.ARPA,
nilsson@SU-SCORE.ARPA, pentland@SRI-STRIPE.ARPA,
watdaisy!dlpoole%watmath.uucp@RELAY.CS.NET,
reiter%utai.toronto.edu@RELAY.CS.NET, stickel@SRI-STRIPE.ARPA,
tyson@SRI-STRIPE.ARPA, waldinger@SRI-STRIPE.ARPA, tw@CSLI.STANFORD.EDU,
woods@BBNG.ARPA
Subject: status report
CSNET has been seriously clogged so things are only starting to happen now.
Sorry for all the delays. The final warning went out today to 10
last-minuters with Jan 12 as the date for sending stuff to Drew. Now if I can
just get *him* to cooperate...
Hector
∂05-Jan-87 0741 yoav%wisdom.bitnet@WISCVM.WISC.EDU me
Received: from WISCVM.WISC.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 87 07:41:36 PST
Received: from (YOAV)WISDOM.BITNET by WISCVM.WISC.EDU on 01/05/87 at
09:41:42 CST
From: Yoav Shoham <yoav%wisdom.bitnet@WISCVM.WISC.EDU>
Date: Mon, 5 Jan 87 10:50:54 -0200
To: de2smith@su-ai.arpa ,
genesereth@su-score.arpa ,
ginsberg@su-ai.arpa ,
grosof@su-ai.arpa ,
jmc@su-ai.arpa ,
lifschitz@su-ai.arpa ,
nilsson@su-score.arpa
Subject: me
Cc: richardson@su-score.arpa
Hi everyone,
Just a short note to let you know my new net address,
which is yoav@wisdom on the bitnet. I'm told that lines
longer thsn
whoops
than 80 lines get truncated.
See you all soon,
Yoav
∂05-Jan-87 0848 RICHARDSON@Score.Stanford.EDU AI Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 87 08:46:32 PST
Date: Mon 5 Jan 87 08:43:54-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: AI Faculty Meeting
To: ai.list: ;
Message-ID: <12268521955.11.RICHARDSON@Score.Stanford.EDU>
It looks as if the best time for most people to meet is on Friday, Jan. 16
from 3:00 - 5:00 so let's go with that. (MJH 220)
-Anne
-------
∂05-Jan-87 1005 AIR lectures
Do you think it would be a good idea for me to attend:
1. your lectures
2. "Fundamentals of AI" by Genesereth & Nilsson?
Thanks
Arkady
∂05-Jan-87 1113 RA Susan McCarthy
Please call Susan (214) 595 6036.
∂05-Jan-87 1144 RA Howard Boyer
Howard Boyer from Harvard University Press called re your review of Hans Moravec
manuscript. Boyer wanted to know whether you have finished. His tel.
(617) 495 2674. In case you finished, I have his address so it can be mailed.
∂05-Jan-87 1448 RA Eli Gray
Gray called. Please call her (312) 475 3733 (home) (312) 984 7416 (office).
She said you know what it is about.
∂05-Jan-87 1520 EPPLEY@Score.Stanford.EDU New telephone number
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 87 15:20:26 PST
Date: Mon 5 Jan 87 15:17:53-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: New telephone number
To: RA@Sail.Stanford.EDU
cc: JMC@Sail.Stanford.EDU, Eppley@Score.Stanford.EDU
Message-ID: <12268593678.20.EPPLEY@Score.Stanford.EDU>
Professor McCarthy's new telephone number is 723-7441. This will be an
unpublished number. And, his published number 723-4430 will appear on
your phone. It will replace the 4-0060 number.
If you have questions, please let me know.
LaDonna
-------
∂05-Jan-87 1602 LES
∂05-Jan-87 1600 JMC
I didn't order the ships' bells.
LES - Eh?
∂05-Jan-87 1625 oshea.pa@Xerox.COM re: Video lectures for new Xerox President
Received: from XEROX.COM by SAIL.STANFORD.EDU with TCP; 5 Jan 87 16:25:09 PST
Received: from Cabernet.ms by ArpaGateway.ms ; 05 JAN 87 15:36:00 PST
Date: Mon, 5 Jan 87 15:35:52 PST
From: oshea.pa@Xerox.COM
Subject: re: Video lectures for new Xerox President
In-Reply-To: "JMC@SAIL.STANFORD.EDU's message of Wed, 31 Dec 86 15:42:00
PST"
To: John McCarthy <JMC@SAIL.STANFORD.EDU>
cc: bobrow.pa@Xerox.COM
Message-ID: <870105-153600-3811@Xerox>
Thank you very much for your helpful answer. Would 10.30 on Wednesday
14th at your office at Stanford be convenient?
References
JMC@SAIL.STANFORD.EDU's message of Wed, 31 Dec 86 15:42:00 PST -- re:
Video lectures for new Xerox President
∂05-Jan-87 1730 guibas@decwrl.dec.com Theory Searches
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 87 17:30:18 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Mon, 5 Jan 87 17:28:11 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA26429; Mon, 5 Jan 87 17:29:00 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA19943; Mon, 5 Jan 87 17:29:02 PST
Date: Mon, 5 Jan 87 17:29:02 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8701060129.AA19943@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com, phy@sail.stanford.edu
Subject: Theory Searches
Sometime today you should all find in your mailbox a write-up summarizing
the current candidates. I propose we meet for a short time friday at 1:30 pm
to discuss the applicants. Although more than half of the letters I have
sent for are not in yet, I think we have enough data to decide to invite
for interviews a couple of them. I'd like us to get started on this
process as soon as possible.
Let me know if the time causes any conflicts and watch this space for
further announcements.
l.
∂05-Jan-87 1738 NILSSON@Score.Stanford.EDU Sr. Fac. Mtg.
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Jan 87 17:38:46 PST
Date: Mon 5 Jan 87 17:35:46-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Sr. Fac. Mtg.
To: binford@Whitney.Stanford.EDU, buchanan@SUMEX-AIM.Stanford.EDU,
feigenbaum@SUMEX-AIM.Stanford.EDU, rwf@Sail.Stanford.EDU,
golub@Score.Stanford.EDU, guibas@decwrl.dec.com,
generesereth@SUMEX-AIM.Stanford.EDU, jlh@Sonoma.Stanford.EDU,
dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU,
ejm@Shasta.Stanford.EDU, miller@SRI-KL.ARPA, nilsson@Score.Stanford.EDU,
oliger@Navajo.Stanford.EDU, papa@Score.Stanford.EDU,
pratt@Navajo.Stanford.EDU, bscott@Score.Stanford.EDU,
ullman@Score.Stanford.EDU, wiederhold@SUMEX-AIM.Stanford.EDU
Message-ID: <12268618778.19.NILSSON@Score.Stanford.EDU>
We weren't quite ready with all of the papers needed for presenting
promotion candidates to the sr. faculty by tomorrow. Therefore, I'd
like to call a sr. fac. mtg for two weeks from tomorrow, namely
Tuesday, Jan 20 at 2:30 p.m. (Anne will confirm the room location;
we'll try for mjh 252).
We now have several letters evaluating Terry Winograd regarding his
possible promotion to Full Professor (Terry isn't receiving a
copy of this net msg). Please stop by my office sometime soon to
look over these letters. The Terry Winograd promotion committee
consisting of Christos Papadimitriou, Stan Peters, and myself is
recommending promotion.
Next week we also ought to have several letters on the Cheriton
and the Lantz cases for you to look at also.
I hope sufficient information will be available well in advance of the
Jan. 20 meeting to make good progress on each of these promotion
matters.
Thanks, -Nils
-------
∂06-Jan-87 0231 YOAV%WISDOM.BITNET@BERKELEY.EDU re: you
Received: from [128.32.136.9] by SAIL.STANFORD.EDU with TCP; 6 Jan 87 02:31:42 PST
Received: by jade.berkeley.edu (5.54 (CFC 4.22.3)/1.16.8)
id AA15947; Tue, 6 Jan 87 02:32:03 PST
Message-Id: <8701061032.AA15947@jade.berkeley.edu>
From: Yoav Shoham <yoav%wisdom.bitnet@BERKELEY.EDU>
Date: Tue, 6 Jan 87 12:22:41 -0200
To: JMC@sail.stanford.edu, yoav%wisdom.bitnet@wiscvm.wisc.edu
Subject: re: you
I think so, although I haven't been here long enough
to know the stats on the bitnet. In case of
emergency, the department phnone number is
011-972-8-483545.
∂06-Jan-87 0952 REGES@Score.Stanford.EDU Re: Play about Turing's life
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Jan 87 09:52:13 PST
Date: Tue 6 Jan 87 09:49:41-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: Re: Play about Turing's life
To: FEIGENBAUM@SUMEX-AIM.Stanford.EDU
cc: nilsson@Score.Stanford.EDU, dek@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU,
ullman@Score.Stanford.EDU
In-Reply-To: <12267209447.12.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Office: CS-TAC 22, 723-9798
Message-ID: <12268796075.36.REGES@Score.Stanford.EDU>
I am very excited about Ed's suggestion to bring the Turing play to Stanford.
When Hodges visited Stanford a couple of years ago I arranged his talk at the
department. I picked him up at the airport and spent some time with him. He
told me about the plans to produce the play, but I hadn't heard anything more
about it. Hodges gave a talk to the gay community about Turing that was very
well attended. There are many gay computer scientists around Stanford.
I will contact Hodges to find out more about the play and talk to some of the
gay students who might be interested in making this project a reality.
-------
∂06-Jan-87 1050 NILSSON@Score.Stanford.EDU Phone Call
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Jan 87 10:50:05 PST
Date: Tue 6 Jan 87 10:47:30-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Phone Call
To: amarel@A.ISI.EDU
cc: nilsson@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12268806599.20.NILSSON@Score.Stanford.EDU>
OK, Saul, your suggestion of having the call at 3:30 pm your time
(12:30 pm our time) on Thurs Jan 8 sounds fine. John McC has a
class at 1:15, but our call shouldn't need to last into that.
I'll initiate the call to you (what phone number is best to
reach you on?), and John will either be in my office on an extension
phone or in his office. (John, you'll let me know which?)
Thanks and Happy New Year to you too, Saul! -Nils
-------
∂06-Jan-87 1335 KHOWARD@Score.Stanford.EDU message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Jan 87 13:35:13 PST
Date: Tue 6 Jan 87 13:32:45-PST
From: Katherine Howard <KHOWARD@Score.Stanford.EDU>
Subject: message
To: jmc@Sail.Stanford.EDU
Message-ID: <12268836683.26.KHOWARD@Score.Stanford.EDU>
Mildred Schleimer from Scientific Datalink would like you to call her at
(212) 838-7200.
--Kathy
-------
∂06-Jan-87 1433 RA Professorship dinner
Debra Stuart called to let you know that the dinner was set for Friday,
Feb. 20 at 6:30 at Hanna House. This is going to be a small dinner and
she needs your list of guests. As a guide for number of guests to invite,
she said that the donor invited 4 peole. She is going to send you a memo
about the dinner.
∂06-Jan-87 1639 guibas@decwrl.dec.com new meeting time: Thursday (1/8), after AFLB in the same room
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Jan 87 16:39:51 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Tue, 6 Jan 87 16:38:12 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA07867; Tue, 6 Jan 87 16:39:00 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA18479; Tue, 6 Jan 87 16:39:03 PST
Date: Tue, 6 Jan 87 16:39:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8701070039.AA18479@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: new meeting time: Thursday (1/8), after AFLB in the same room
Be thinking about which of the candidates you are sufficiently excited
about to act as sponsor (i.e., to arrange the interview). To my knowledge
only Christos has a conflict and he can arrive a bit later.
Please be there!
l.
∂06-Jan-87 1717 SCHAFFER@sushi.stanford.edu Inviting candidates for AFLB
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Jan 87 17:17:32 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 6 Jan 87 17:15:49 PST
Date: Tue 6 Jan 87 17:13:36-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Inviting candidates for AFLB
To: fndsch@navajo.stanford.edu
Message-Id: <12268876885.18.SCHAFFER@Sushi.Stanford.EDU>
From the biographical sketches I got, it would seem that most, though
not all, of the candidates would give talks appropriate for an AFLB.
Last year we had one talk at the regular AFLB time and two "special"
AFLB's. It would make my job as AFLB coordinator easier if we could
fill some Thursday slots with faculty candidates. However, before
inviting anybody to talk on a Thursday check the file
<SCHAFFER>aflb:aflb.dates on sushi to make sure I haven't already
invited somebody else for that day. In that file I list all the
Thursdays through April when I expect there to be an AFLB. On the same
line as a given Thursday I list the speaker, if any, for that day.
Also, let me know after an invitation is accepted so that I can update
the file.
Alex Schaffer
-------
∂06-Jan-87 1740 LES DEC-10 History Project
Here is a draft outline of a prospective book on 36-bit DEC timesharing
that I have tentatively agreed to help edit. We want to talk you into
writing an introduction at some point. If you have any comments on this
outline, they would be welcome -- I have a few.
∂05-Jan-87 2023 DEMPSTER@MARLBORO.DEC.COM PROJECT.10262 announcement draft.
Received: from MARLBORO.DEC.COM by SAIL.STANFORD.EDU with TCP; 5 Jan 87 20:22:55 PST
Date: 5 Jan 1987 2320-EST
From: "Joe Dempster, Location Code: CHO, DTN 336-2252" <DEMPSTER@MARLBORO.DEC.COM>
To: les@sail.stanford.edu
cc: dempster@MARLBORO.DEC.COM
Subject: PROJECT.10262 announcement draft.
Message-ID: <"MS11(5206)+GLXLIB5(0)" 12268648840.17.48.15525 at MARLBORO.DEC.COM>
Les,
Here is the document I've been promising. Your comments,
suggestions and improvements are welcomed.
/joe
--DRAFT----DRAFT----DRAFT----DRAFT----DRAFT----DRAFT--
----This is a phase 0 review----
To: TOPS-20@SU-SCORE.ARPA, AIList@SRI-STRIPE.ARPA
From: Dempster@MARKET and Les (Earnest)@SAIL
Subject: Announcement of the DEC 10 and PDP-6 history project
(PROJECT.10262).
--This notice is being posted to the ARPA TOPS20-EXPERTS list
and AIList. Postings to additional appropriate "nets" are
welcomed.--
The goal of this project is to publish a analysis and history of
the evolution, implementation and use of Digital's 36 bit systems,
which were first introduced in 1964 (PDP-6).
The project will attempt to answer the following questions:
--In what markets were these systems designed to compete?
--Who built them, what design innovations flowed from these
efforts and what features never quite became reality but
would have significantly improved the architecture?
--What part of the overall design (TOPS10/20) was technology
dependent and what can still be considered "unequaled"
in implementation today?
--What type of development environment (both HW and SW)
supported and contributed to 36 bit system innovations.
--Who were the users of these systems and what impact did
roughly 2,500 36 bit systems have on the computing
environment they existed in the years following 1964?
This history will be assembled from many sources and participants.
Some information will be anecdotal in content, there will be interviews
with the people involved (users and developers), technical papers
will be solicited, in addition to the packaging and assembly of
facts as we see them.
The result will hopefully have sufficient depth to serve as:
--A introductory or advanced text on system design and
hardware/system software implementation.
--A analysis of the success and difficulties of marketing
complex systems into a very crowded market of competing
alternatives.
--A catharsis for those of us who have contributed to the
development and use these systems and who will now move
onto new computing architectures and opportunities.
In addition to interviewing directly 25-50 developers, users and
product line managers we intend to make full use of the ARPAnet.
There will also be a 2020 system available for direct access, and
not attached to any "net", to support the project. This system
will be up 24 hours a day and will remain installed for the
duration of this project. Dial-in numbers will be posted as soon
as the system install is completed.
A evolving project outline will be available via ANONYMOUS FTP
over the ARPAnet from SAIL (SAIL.STANFORD.EDU) <DIRECTORY> and
MARKET (MARLBORO.DEC.COM) [<GUMBY>:DEMPSTER.PROJECT.10262] and
directly from MINNOW (the 2020) via a "public" account:
LOG PROJECT.10262 <PW> LCGLCG
Implementation details:
--User input is welcomed and desired from all application
and geographic areas.
--Input from past and present developers is also desired.
--Throughout the project a secondary goal will be to build
a list of users/locations of all PDP-6 and KA, KI, KL
and KS hardware identified by system serial number.
--We anticipate that this project will generate a large
volume of information, some of which will not be
publishable or in line with the project's stated goals.
Therefore, all notes, interview material and submissions
will be donated to the Computer Museum in Boston to be
available for future reference and research.
Preliminary project outline:
1.0 INTRODUCTION
Project outline.
2.0 TIMESHARING
A brief historical look at timesharing. Sketches of
major implementations and a brief reference to where
DECsystems fit into this history.
3.0 TOPS
Examine the influence these systems had on the development
of the ARPANET, AI research and university and industry
computing models.
4.0 HARDWARE
What were the design innovations of this architecture?
How can/should these efforts be related to today's
system design/implementation efforts?
Some time will be devoted to examining the projects
which were developed (or almost) but never made it
--MINNOW, DOLPHIN, JUPITER) because of technology
shortcomings in implementations, over ambitious design
goals, marketing decisions, etc.
5.0 SYSTEM SOFTWARE
Track the development and functionality of the PDP-6,
TOPS 10 and TOPS20 monitors.
6.0 SELLING LARGE SCALE SYSTEMS
How were these systems marketed and sold, or rather
why did people buy them?
7.0 USER PROFILES
Some how the "average" 36 bit system user is identified
and describes why and how they used their systems when
there were so many alternatives and how their competitive
position benefited.
8.0 PS:<UNSUPPORTED>*.*
Many fine developments and efforts were made by people
outside of Marlboro which helped make these systems
more useful and desirable. Candidates include custom
complier work, CTERM, TELNET, EMACS, MM, WINDOW, etc.
9.0 GREAT, BUT IF WE HAD JUST BEEN ABLE TO ....
A look at what would have made things even better if
time and money had been available.
APPENDIX
--Pictures
--A fold out family tree, complete with everything
that made it and didn't. HW and SW could be merged
into one--something similar to what the Computer
Museum did a few years back.
Ideas, contributions, suggestions and criticism are welcome. As these
36 bit systems were the products of a multitude of people, so too
will be this project.
--------
∂07-Jan-87 0832 PETTY@RED.RUTGERS.EDU '87January abstract mailing
Received: from RED.RUTGERS.EDU by SAIL.STANFORD.EDU with TCP; 7 Jan 87 08:32:36 PST
Date: 7 Jan 87 11:25:54 EST
From: PETTY@RED.RUTGERS.EDU
Subject: '87January abstract mailing
To: arpanet.mail: ;
cc: petty@RED.RUTGERS.EDU
Message-ID: <12269042966.19.PETTY@RED.RUTGERS.EDU>
@make(text)
@begin(description)
Below is a list of our newest technical reports.
The abstracts for these are available for access via FTP with user account
<anonymous> with any password. The file name is:
<library>tecrpts-online.doc
If you wish to order copies of any of these reports please send mail via the
ARPANET to PETTY@RUTGERS. Thank you!!
[ ] CBM-TR-147 - (THESIS) - (If you wish to order this thesis,
a pre-payment of $15.00 is required.) "REFINEMENT OF EXPERT SYSTEM
KNOWLEDGE BASES: A METALINQUISTIC FRAMEWORK FOR HEURISTIC ANALYSIS",
A. Ginsberg.]
[ ] DCS-TR-131 - (REVISED) - "INCREMENTAL DATA FLOW ANALYSIS
ALGORITHMS", B.G. Ryder and M.C. Paull.
[ ] DCS-TR-168 - "ONLY THE COMPLEMENTS OF RECURSIVELY
ENUMERABLE SETS CAN BE RELIABLY IDENTIFIED IN THE LIMIT",
A. Van der Mude.
[ ] DCS-TR-176 - (REVISED) - "WAVE PROPAGATION ANALYSIS OF
DIFFERENCE SCHEMES FOR HYPERBOLIC EQUATIONS: A REVIEW",
R. Vichnevetsky.
[ ] DCS-TR-198 - "P-UNIFORM CIRCUIT COMPLEXITY", E.W. Allender.
[ ] DCS-TR-200 - "INTELLIGENT QUERY ANSWERING IN RULE BASED
SYSTEMS", T. Imielinski.
[ ] DCS-TR-203 - "SELECTING SLOPES", R. Cole, J. Salowe and
W.J. Steiger.
[ ] DCS-TR-204 - "OPTIMAL PARALLEL SELECTION HAS COMPLEXITY
O(LOGLOG N)", M. Ajtai, J. Komlos, W.L. Steiger and E. Szemeredi.
[ ] LCSR-TR-84 - "A PROPOSAL FOR AUTOMATING SHIFTS OF
REPRESENTATION", P.J. Riddle.
[ ] LRP-TR-18 - "FIXED POINT SEMANTICS AND TABLEAU PROOF
PROCEDURES FOR A CLAUSAL INTUITIONISTIC LOGIC", L.T. McCarty.
[ ] LRP-TR-19 - "PERMISSIONS AND OBLIGATIONS: AN INFORMAL
INTRODUCTION", L.T. McCarty.
@end(description)
-------
∂07-Jan-87 0910 RICHARDSON@Score.Stanford.EDU Reception for Jean-Claude Latombe
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Jan 87 09:10:45 PST
Date: Wed 7 Jan 87 09:08:04-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Reception for Jean-Claude Latombe
To: robotics.list: ;
Message-ID: <12269050641.9.RICHARDSON@Score.Stanford.EDU>
You are cordially invited to a reception on Tuesday, January 20 at 5:30
in Cedar Hall to welcome Associate Professor Jean-Claude Latombe to the
Computer Science Department.
-------
∂07-Jan-87 0923 RA meeting with NSF people
I cancelled your meeting for Thursday Jan. 8. As to Jan. 19, it is a
holiday so no other date was set. I therefore did not make any travel
arrangments for Jan. 18.
∂07-Jan-87 0937 CLT Qlisp meeting reminder
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU, aap@SUMEX-AIM.STANFORD.EDU
Professor Takayasu Ito of Tohoku University, Sendai Japan
is visiting Stanford this week. He will tell us about
work in his laboratory on design and implementation of
parallel computers and parallel Lisps.
We will discuss how the Qlisp model of parallel computation
relates to Professor Ito's work.
Time: Friday Jan 9, 11:00
Place: 252 Margaret Jacks
∂07-Jan-87 1047 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU re: star wars continued
Received: from UCBVAX.Berkeley.EDU by SAIL.STANFORD.EDU with TCP; 7 Jan 87 10:47:06 PST
Received: by ucbvax.Berkeley.EDU (5.53/1.20)
id AA23749; Wed, 7 Jan 87 10:47:24 PST
Received: by ucscc (5.51/4.7)
id AA04660; Wed, 7 Jan 87 10:46:46 PST
Received: by ucscd (5.51/4.7)
id AA24607; Wed, 7 Jan 87 10:47:10 PST
Date: Wed, 7 Jan 87 10:47:10 PST
From: ucscc!ucscd.beeson@ucbvax.Berkeley.EDU (20012000)
Message-Id: <8701071847.AA24607@ucscd>
To: ucbvax!SAIL.STANFORD.EDU!JMC, ucscd.beeson@ucscc
Subject: re: star wars continued
The Felton address is long out of date and anything sent there will never
reach me. Here are my correct addresses: home, 185 View Court, Aptos CA
95003. Work, Department of Mathematics and Computer Science, San Jose
State University, San Jose 95192.
You have correctly exposed an implicit premise in my argument for
proposition 2. However before working on that proof, let's consider
the proof of proposition 1. Formalizing that proof requires the
concepts of "offensive" and "defensive". These in turn require the
concepts of "attack" and "threat!!!!", which in turn will require the
concept of "danger", or perhaps "threat" is more primitive than "danger".
These in turn depend on "damage" or "harm" or "loss", which in turn
depend on "health". This is itself a difficult concept, applying as it
does not only to an organism but to the organism's enviroment, e.g. to
its food supply, its loved ones, etc. All this will be fundamental
when you go to formalize common-sense knowledge! You can't say that
a given thing (weapon) is offensive or defensive, formally speaking,
only that a given USE or THREATENED USE of it is offensive or defeive.
In the case of Star Wars we are talking about THREATENED USES. Now
the difficulty is that a threatened use exists separately for the
various agents involved, and the threatened use as perceived by the
possessor of the weapon may not be the same as perceived by the
one threatened. Thus we must consider perceptions of threat as well
as objective threat. But is there such a thing as objective threat?
Suppose A has a weapon with which he could inflict damage X on B.
Then B may perceive that he is threatened by A. However A, having no
malevolent intentions, may perceive that he is not threatening A.
The facts of the Star Wars matter are that the systems under consideration
(i∞ncluding any ground-based system) would be ineffective as a defense
and possibly effective only in conjunction with an attack. (Agreed?)
Now the missing point in the reasoning is this: that the decision-makers
who decide whether to continue the program KNOW THIS PROPOSITION.
For if they do, then further conclusions can be drawn concerning their
motivations and intentions, at least maybe they can. The missing
proposition is that they KNOW that star wars can't be effective as a
defense. What do you think, do they know it or not?
∂07-Jan-87 1305 RA Professorship dinner
Richard Stearns from Devolopment Publication office called you re a commemorative
pamphlet which they would like to publish for the Charles Pigot
professorship dinner. He would
like you to write a letter describing how you feel about getting the
professorship and a description of your current research and teaching. His office
can give you a freelance writer who would come to your office and help you
in drafting the letter. In order to have the pamphlet ready by the dinner
date, the letter has to be written by January 15. Stearns tel. no. is 5-4286
He would like you to call him when you come back.
∂07-Jan-87 1353 KHOWARD@Score.Stanford.EDU message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Jan 87 13:53:47 PST
Date: Wed 7 Jan 87 13:49:43-PST
From: Katherine Howard <KHOWARD@Score.Stanford.EDU>
Subject: message
To: jmc@Sail.Stanford.EDU
Message-ID: <12269101915.11.KHOWARD@Score.Stanford.EDU>
Carl Ruoff from the Cal Tech Jet Propulsion Laboratory called. He wants to in-
vite you to be on a NASA advisory committee on space telerobotics. He would
like you to call him at (818) 354-6101 (JPL) or (818) 356-4165 (campus) or
(818) 249-2944 (home).
--Kathy
-------
∂07-Jan-87 1457 YOUNG@Sushi.Stanford.EDU CS326 Grade Change
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Jan 87 14:57:45 PST
Date: Wed 7 Jan 87 14:54:50-PST
From: Michael Young <YOUNG@Sushi.Stanford.EDU>
Subject: CS326 Grade Change
To: jmc@Sail.Stanford.EDU
Message-ID: <12269113770.56.YOUNG@Sushi.Stanford.EDU>
John,
I took CS326 two years ago for Pass/NoCredit, and would like to
change the old Pass to a letter grade if possible. I spoke to you
last Spring and you suggested that I wait until it was taught again
and write the term paper for a grade. Is this still a possibility?
-Michael
-------
∂07-Jan-87 1510 RA Orlov's visit
Sam Kheifets from SLAC called re Orlov's visit. Please call him at SLAC
854 3300 ext. 2935.
∂07-Jan-87 1558 VAL cs326
In the first lecture I talked about the logic approach in general and about the
plan of the course, covered about 2/3 of the handout and assigned a few problems.
I said you would give the second lecture and answer their questions about exams
and such. Also I gathered some data about their background in logic and AI.
There were 30 people in the audience.
∂07-Jan-87 1642 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
NEW RESULTS ON TIME MODELLING WITH INTERVALS
Peter Ladkin
Kestrel Institute
(ladkin@kestrel.arpa)
Thursday, January 15, 4pm
Bldg. 160, Room 161K (NEW PLACE!)
James Allen introduced a calculus for reasoning about time using
intervals, instead of points. In this talk, we shall indicate two
new results for time modelling using intervals, and indicate why
they help overcome some of the objections to using an interval system
for reasoning about time. Much of this work is joint with Roger
Maddux. Briefly, we have shown that there is only one countable
representation of the calculus, up to isomorphism, and that the
system of time units introduced in [Ladkin AAAI-86] is isomorphic
to this countable representation.
∂07-Jan-87 1649 VAL question
Is there a conflict between publishing a paper in the proceedings of a AAAI
sponsored workshop and then presenting a short version at IJCAI?
∂08-Jan-87 0300 JMC
papers for Anne Wortham
∂08-Jan-87 0619 CHANDRA%OSU-20@ohio-state.ARPA re: Support request for TICIP Workshop
Received: from OHIO-STATE.ARPA by SAIL.STANFORD.EDU with TCP; 8 Jan 87 06:19:32 PST
Return-Path: <CHANDRA%OSU-20@ohio-state.ARPA>
Received: from OSU-20 (osu-20.ARPA) by ohio-state.ARPA (4.12/6.1.OSU-CIS)
id AA05990; Thu, 8 Jan 87 09:17:32 est
Message-Id: <8701081417.AA05990@ohio-state.ARPA>
Date: Thu 8 Jan 87 09:19:02-EST
From: B. Chandrasekaran <Chandra%OSU-20@ohio-state.ARPA>
Subject: re: Support request for TICIP Workshop
To: JMC@SAIL.STANFORD.EDU
Cc: Chandra%OSU-20@ohio-state.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 8 Jan 87 00:39:00-EST
Thanks very much on behalf of TICIP.
-- Chandra
-------
∂08-Jan-87 1000 JMC
Saul call 12:30
∂08-Jan-87 1000 JMC
Mildred Schleimer from Scientific Datalink would like you to call her at
(212) 838-7200.
I cancelled your meeting for Thursday Jan. 8. As to Jan. 19, it is a
∂07-Jan-87 1305 RA Professorship dinner
Richard Stearns from Devolopment Publication office called you re a commemorative
Carl Ruoff from the Cal Tech Jet Propulsion Laboratory called. He wants to in-
vite you to be on a NASA advisory committee on space telerobotics. He would
like you to call him at (818) 354-6101 (JPL) or (818) 356-4165 (campus) or
(818) 249-2944 (home).
Sam Kheifets from SLAC called re Orlov's visit. Please call him at SLAC
854 3300 ext. 2935.
∂08-Jan-87 1056 RA 12:30 tel. call
Nils wanted to remind you of the 12:30 telephone call in his office.
∂08-Jan-87 1151 LES Call to Amarel
Nils want to know if you are planning to do the 12:30 call from home or
Jacks.
∂08-Jan-87 1200 JMC
Pony bill $4.00
∂08-Jan-87 1229 REGES@Score.Stanford.EDU TA for 326?
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 8 Jan 87 12:29:39 PST
Date: Thu 8 Jan 87 12:17:11-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: TA for 326?
To: jmc@Sail.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12269347212.23.REGES@Score.Stanford.EDU>
I think I can find you a TA for 326. Do you want one? I have it down as a 25%
position. The two leading candidates right now are a PhD student who has passed
his AI Qual and an MS/AI student.
-------
∂08-Jan-87 1314 RA do you mind?
Would you mind if I left at 3:00 today?
Thanks,
∂08-Jan-87 1327 RA meeting in D.C. 1/21
Is the meeting with Bell, Curtis, and Keenan one meeting or three separate ones?
∂08-Jan-87 1331 RA your telephone
It turns out that you can't have two separate numbers which will both ring
in your office on the type of phone you have now. You will need a different
type of phone, the ET. I told LaDonna to go ahead and get you one. If you
disagree, let me know.
∂08-Jan-87 1452 RA Richard Stearns
He called re the letter for professorship dinner. Please call him 5-4286.
∂08-Jan-87 1546 GUNNING@Sushi.Stanford.EDU McDermott and the endgame problem
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 8 Jan 87 15:46:42 PST
Date: Thu 8 Jan 87 15:28:52-PST
From: David R. Gunning <GUNNING@Sushi.Stanford.EDU>
Subject: McDermott and the endgame problem
To: jmc@Sail.Stanford.EDU
Message-ID: <12269382107.26.GUNNING@Sushi.Stanford.EDU>
Prof McCarthy,
Drew McDermott did develop a solution to the chess problem you discussed in
class. In fact, he credits you with posing the problem, and his solution
specifically addresses the "continuous" reasoning process. Look at pages
302-312 of Hobbs and Moore's FORMAL THEORIES OF THE COMMONSENSE WORLD.
I should have kept quiet and used his ideas for the term paper.
David Gunning
←
-------
∂08-Jan-87 1732 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 8 Jan 87 17:32:16 PST
Date: Thu 8 Jan 87 17:12:02-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: Re: SERC probation report!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 30 Dec 86 17:17:00-PST
Message-ID: <12269400889.28.ROBERTS@Sushi.Stanford.EDU>
JMC: you were going to send this to me for me to send to Nils? If you
could, Ihave to keep my probation officer - I mean sponsor - happy!
thanks for letting me know...
Paul
-------
∂08-Jan-87 1743 ROBERTS@Sushi.Stanford.EDU re: SERC probation report!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 8 Jan 87 17:43:10 PST
Date: Thu 8 Jan 87 17:39:13-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: re: SERC probation report!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 8 Jan 87 17:38:00-PST
Message-ID: <12269405837.28.ROBERTS@Sushi.Stanford.EDU>
Ok, thanks. It didn't turn up in my mail folder, or would you have sent it
directly to Nils?
Paul
-------
∂09-Jan-87 1001 JMC
Call Schroeppel about SAB
∂09-Jan-87 1022 RA meetings 1/21/87
You have an appointment with Keenan at 10:00am and Bell at 11:00. Curtis was
not in and will call me back. Will 1:30 be ok (this will give you time for lunch)
∂09-Jan-87 1043 VAL WICS
Please look at the description of our summer course in wics[1,val]. They want it
today.
∂09-Jan-87 1141 SCHAFFER@sushi.stanford.edu Daniel Sleator's visit
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Jan 87 11:41:26 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Fri, 9 Jan 87 11:40:01 PST
Date: Fri 9 Jan 87 11:36:53-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Daniel Sleator's visit
To: fndsch@navajo.stanford.edu
Message-Id: <12269602022.13.SCHAFFER@Sushi.Stanford.EDU>
Daniel Sleator would like to visit during the week of Feb. 23-27.
I believe at this point we decided that Professor Knuth is supposed
to Sleator to send his vita and application etc. I'm not sure if we
decided whether Professor Guibas or Professor Knuth will be the
``host''.
Alex
-------
∂09-Jan-87 1153 RA please call
Please call home when you get this.
∂09-Jan-87 1500 JMC
818 354-6101
∂09-Jan-87 1517 VAL
Please send me a copy of the TA's message you've mentioned.
∂09-Jan-87 1618 RA Carl Ruoff
Please call Carl Ruoff at his home after 6:00, (818) 248 2944. re: NASA
advisory committee.
∂09-Jan-87 1640 JUTTA@Score.Stanford.EDU re: MS Committee meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Jan 87 16:40:37 PST
Date: Fri 9 Jan 87 16:37:46-PST
From: Jutta McCormick <JUTTA@Score.Stanford.EDU>
Subject: re: MS Committee meeting
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 9 Jan 87 16:37:00-PST
Stanford-Phone: (415) 723-0572
Message-ID: <12269656794.41.JUTTA@Score.Stanford.EDU>
No, both students are Gio's advisees and have been in the program for a while.
---
-------
∂09-Jan-87 1645 ortiz@spam.istc.sri.com Approximate Theories
Received: from SPAM.ISTC.SRI.COM by SAIL.STANFORD.EDU with TCP; 9 Jan 87 16:45:28 PST
Received: by spam.istc.sri.com (5.51/4.16)
id AA10307 for jmc@sail; Fri, 9 Jan 87 16:45:42 PST
Message-Id: <8701100045.AA10307@spam.istc.sri.com>
To: jmc@sail
Cc: ortiz@spam.istc.sri.com
Subject: Approximate Theories
Date: Fri, 09 Jan 87 16:45:40 -0800
From: Charlie Ortiz <ortiz@spam.istc.sri.com>
I attended your last talk on context at teh non-monotonic reasoning
seminar in which you referenced your paper "Ascribing Mental Qualities
to Machines." I haven't been able to acquire a copy of it. Could you
send me one in the mail? Here is my postal address:
Charles Ortiz
SRI International
Room Ek335
333 Ravenswood Ave
Menlo Park, Ca 94025
Thank you very much.
∂09-Jan-87 1751 LES
∂29-Dec-86 2033 JMC re: Gosper account
[In reply to message rcvd 29-Dec-86 18:55-PT.]
I'll ask him what if any use he has for it.
LES - Any word?
∂10-Jan-87 0745 JJW 2400 baud modems
CTS makes a 2400 baud modem that sells for around $250 (if bought
through Stanford). Would it be possible to get these for those of
us with home terminals?
∂10-Jan-87 0904 ullman@navajo.stanford.edu Re: Daniel Sleator's visit
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Jan 87 09:03:59 PST
Received: by navajo.stanford.edu; Sat, 10 Jan 87 09:00:12 PST
Date: Sat, 10 Jan 87 09:00:12 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Re: Daniel Sleator's visit
To: SCHAFFER@sushi.stanford.edu, fndsch@navajo.stanford.edu
Sorry I didn't make the meeting.
Of the people on Leo's list, the one that interested me the most
was Richard Cole. Any interest?
---jdu
∂10-Jan-87 1954 guibas@decwrl.dec.com summary of meeting, January 8, 1987
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Jan 87 19:53:59 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Sat, 10 Jan 87 19:42:12 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA07028; Sat, 10 Jan 87 19:43:11 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA18843; Sat, 10 Jan 87 19:43:03 PST
Date: Sat, 10 Jan 87 19:43:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8701110343.AA18843@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com, Nilsson@score.stanford.edu
Subject: summary of meeting, January 8, 1987
We decided as follows on the names in the "first choice" list:
Baldi: on hold
Breazu-Tannen: on hold
Cole: interview, Mayr is host (perhaps Ullman should be, instead)
Friedman: interview, Mayr is host
Landau: collect more info, Guibas
Maley: collect more info, Guibas
Mitchell: interview, Pratt is host
Mulmuley: collect more info, Papadimitriou
Schieber: collect more info, Guibas
Sleator: interview, Knuth is host
Several new reference letters have come in during the last two days ...
L.
∂11-Jan-87 0153 GLB
According to prof. Stuart Hampshire, who is the expert
on Leibniz here in Stanford, it is a widely accepted view, that
the use of logic in Artificial Intelligence can indeed be related to
Leibniz's proposal of a symbolic language (Characteristica Universalis)
and of a formal calculus using it. The notion of a robot performing
intelligent operations, on the other hand, is not traceable to Leibniz,
but Turing's views fit well, according to prof. Hampshire, in Leibniz's
line of thought. I conclude that the assertion in your paper should not
encounter objections.
A paper by Jonathan Cohen ("On the Project of a Universal Character", Mind 63,
pp. 49-63, 1954) documents that "... it is only this conception of a logical
calculus as an ancillary to his universal character which distinguishes
Leibniz's thought from that of some of his contemporaries and predecessors.
Several of these projected, and some completed, a universal character
which they hoped would fill the same three roles as Leibniz had in mind,
consituting at once a medium of international communication, a simplified
notation for science, and a method of discovery and demonstration." (pp. 50-51)
Related projects for simplified or symbolic languages and their discussions
can be found in writings by Francis Bacon (1605), Descartes (1629),
Mersenne (1636), Lodwick (1647, 1652), Cave Beck (1657), Athanasius Kircher (1661),
George Dalgarno (1661), and John Wilkins (1668).
Leibniz conceived his project at the age of eighteen (1664) and thought
about it throughout his life: references occur often in his correspondence.
Here is a reference from which you may extract a quotation:
"Children, who have only a little experience, are nevertheless able
to understand a great deal that a skilled instructor explains to them,
even if he doesn't show them anything but only describes. Therefore
it is necessary that concepts of all those many things are latent
in them and arise from the few with which they are already acquainted.
Thus an intelligent and attentive child, however inexperienced, can
understand an instructor discoursing about mathematics, morals,
jurisprudence, and matters metaphisical - he will understand, I say,
at least at the time when they are presented to him, even though,
because of lack of experience, he is unable to retain them or put
them to practical use.
It follows irrefutably that if somebody entered in a catalog all the
primitive concepts which that child has, with a letter or character
assigned to each, together with all the concepts composed of these
(i.e., all the concepts which could be explained to that child without
putting anything new before his eyes), he would be able to designate
[all of these] with combinations of those letters or characters...
This designation of concepts will have the virtue that the same
relation will obtain among the characters as among the concepts,
which is not the case in ordinary speach...
Thus I assert that all truths that can be demostrated about things
expressible in this language with the addition of new concepts
not yet expressed in it - all such truths, I say, can be demonstrated
`solo calculo', or solely by manipulation of characters according to
a certain form, without any labor ot the imagination or effort of the
mind, just as occurs in arithmetic and algebra".
(translated in Benson Mates, The Philosophy of Leibniz, Metaphisics
and Language, Oxford University Press, 1986, pp.184-5, footnote)
Apparently, "Leibniz ... assumed ... that if all valid inferences in a
language were formally valid, there would necessarily be an algorithmic
decision procedure for determining whether or not given inferences
were correct" (ibidem, p.184).
On his copy of Dalgarno's book, Leibniz wrote about Dalgarno and Wilkins:
"...these distinguished men do not seem to have grasped the magnitude
or the true use of the project. For their language or notation only
accomplishes the facilitation of communication between people who
speak different languages; but the true Characteristica Realis, as
I conceive it, ought to be accounted one of the most effective
instruments of the human mind, having immense potential for [aiding the]
discovery, retention, and evaluation [of knowledge]. For it does in all
subject matter what is done in mathematics by arithmetic and algebraic
notation, the great power and admirable uses of which are well known
to the experts" (ididem, p. 188).
Let me know if you are not satisfied with these quotations.
∂11-Jan-87 1321 OKUNO@SUMEX-AIM.STANFORD.EDU Thanks
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 13:21:29 PST
Date: Sun 11 Jan 87 13:20:10-PST
From: Hiroshi "Gitchang" Okuno <Okuno@SUMEX-AIM.STANFORD.EDU>
Subject: Thanks
To: clt@SAIL.STANFORD.EDU, jmc@SAIL.STANFORD.EDU
Message-ID: <12270145112.19.OKUNO@SUMEX-AIM.STANFORD.EDU>
Carolyn, John and Timothy,
Thank you for inviting us to the dinner. We enjoyed the dinner
and talk with you. Moreover, it was a great honor for us to have
dinner with your family.
Regards,
- Gitchang, Yoshiko and Chihaya -
-------
∂11-Jan-87 1342 JUSTESON@Sushi.Stanford.EDU Problem 4
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 13:42:06 PST
Date: Sun 11 Jan 87 13:38:59-PST
From: John S. Justeson <JUSTESON@Sushi.Stanford.EDU>
Subject: Problem 4
To: val@Sail.Stanford.EDU
cc: jmc@Sail.Stanford.EDU
Message-ID: <12270148536.20.JUSTESON@Sushi.Stanford.EDU>
There seems to be an error in Problem 4. clear B cannot be proved without
the axiom A ne B, but with this axiom the other two axioms in (5) are
unnecessary. I.e., with A ne B, A=C (hence B ne C) or A ne B, B=C (hence
A ne C), clear B is equivalent to NOT(on(A,B)) AND NOT (on(B,B)), each
conjunct being provable from (1) and (4).
-- John
-------
∂11-Jan-87 1440 MAYR@score.stanford.edu hosting Cole
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 14:40:27 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Sun, 11 Jan 87 14:38:00 PST
Date: Sun 11 Jan 87 14:35:45-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: hosting Cole
To: fndsch@navajo.stanford.edu
Message-Id: <12270158870.19.MAYR@Score.Stanford.EDU>
I wouldn't mind if Jeff wants to host Richard Cole. Anyway, since I've
already sent a message to Cole to set up his visit, we might not try to
confuse him more than necessary.
-ernst
-------
∂11-Jan-87 1504 ANDY@Sushi.Stanford.EDU re: Libertarian
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 15:04:29 PST
Date: Sun 11 Jan 87 15:01:23-PST
From: Andy Freeman <ANDY@Sushi.Stanford.EDU>
Subject: re: Libertarian
To: JMC@Sail.Stanford.EDU
cc: SU-ETC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 10 Jan 87 13:59:00-PST
Message-ID: <12270163538.17.ANDY@Sushi.Stanford.EDU>
Oops, "groups claim that libertarians are inherently oppressive"
should have been "people ..." as I have citations to support the
latter. The people I was thinking of are the "politically aware" on
usenet. (They claim the title and it often supports their authority
to "educate", read "judge", the rabble.) The ones that yell
"Libertarians are oppressive" the loudest are usually somewhere
between socialist and communist politically. (I don't keep track of
the sects, so I haven't broken it down further. Note, I haven't said
that all leftist beliefs oppose Libertarianism.) They may deserve
their "title", as their arguments in support of the "Libertarians are
oppressive" conclusion are basically "Libertarians are selfish". The
former is considered a greater sin these days and it is politically
acceptable to "adjust" oppressors.
If the groups these people are involved with admit that Libertarians
exist (the major political parties always ignore minor ones and minor
ones ignore other minor parties), I expect them to use the same
arguments. The groups that others claim to belong to, eg southern
Democrat, Californian Republican, use the same arguments that there
members use.
One thing that is interesting about on-line political discussions is
that the percentages of people belonging to various groups are much
different from that in the real world. (University people are
over-represented, but they aren't in the majority.) Moderates, of
course, don't participate as they don't have the fanatical stamina.
Libertarians are much more common than in the real world. (That is,
they are more common on the net, relative to other "fringe" groups,
than they are out here.)
-andy
-------
∂11-Jan-87 1818 VAL re: Problem 4
To: JUSTESON@SUSHI.STANFORD.EDU
CC: JMC@SAIL.STANFORD.EDU
[In reply to message from JUSTESON@Sushi.Stanford.EDU sent Sun 11 Jan 87 13:38:59-PST.]
By "cannot be proved without axioms (5)" I meant "cannot be proved if all
axioms (5) are dropped". You are right, only one of the axioms is actually
needed here.
Vladimir
∂11-Jan-87 1856 MACMILK@Score.Stanford.EDU re: address book/week-at-a-glance 1985 found
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 18:56:19 PST
Date: Sun 11 Jan 87 18:53:21-PST
From: Katie MacMillen <MACMILK@Score.Stanford.EDU>
Subject: re: address book/week-at-a-glance 1985 found
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 10 Jan 87 01:12:00-PST
Message-ID: <12270205766.26.MACMILK@Score.Stanford.EDU>
thanks, i had already sent messages to all the people that
went tor rice, according to xsearch and our resumes... nothing
has turned up, but i appreciate your help.
-katie
-------
∂11-Jan-87 1918 NILSSON@Score.Stanford.EDU Re: private offices for Senior Research Associates
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 19:18:54 PST
Date: Sun 11 Jan 87 19:16:01-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: private offices for Senior Research Associates
To: JMC@Sail.Stanford.EDU
cc: NILSSON@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 11 Jan 87 18:00:00-PST
Message-ID: <12270209891.16.NILSSON@Score.Stanford.EDU>
I don't know about the rule, but I have requested offices for all
research associates (senior and regular) in my space-needed plans
for the NWC. These plans have been approved by the SOE (acknowledging
the reasonableness of them), but of course when we finally build the
building(s) there may be cuts, etc. and we may be expected to squeeze.
We'll simply have to resist as strongly as possible any pressure to
cut.
-------
∂11-Jan-87 1919 NILSSON@Score.Stanford.EDU Re: private offices for Senior Research Associates
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Jan 87 19:19:24 PST
Date: Sun 11 Jan 87 19:16:28-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: private offices for Senior Research Associates
To: JMC@Sail.Stanford.EDU
cc: NILSSON@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 11 Jan 87 18:00:00-PST
Message-ID: <12270209975.16.NILSSON@Score.Stanford.EDU>
That's "private offices" that I've requested for all res. assocs.
-------
∂12-Jan-87 1035 RA Steven Graubard
The February conference in Los Almos was postponed until May. You will be
notified later about the May date.
∂12-Jan-87 1105 VAL wics
They want to know by 1pm today whether we're going to use a text. I propose
to use a subset of the reading list for the course. Say, your circ'n papers
and two of mine plus a paper of yours on another subject. Is this ok? If yes,
which paper of yours would you add? Another possibility would be to use the
new book by Genesereth and Nilsson.
∂12-Jan-87 1112 RA Kent Curtis
Your meeting with Kent Curtis is Jan. 21, at 1:00pm.
I will make your travel arrangements.
∂12-Jan-87 1227 VAL
Gelfond says he is sending a paper to the Moscow congress.
∂12-Jan-87 1315 TEICH@Sushi.Stanford.EDU My degree plan
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Jan 87 13:15:37 PST
Date: Mon 12 Jan 87 12:39:26-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: My degree plan
To: jmc@Sail.Stanford.EDU
cc: : ;
Message-ID: <12270399839.42.TEICH@Sushi.Stanford.EDU>
During the break between quarters I had a chance to study my degree plan.
I feel that having passed courses in 360/370 Assembler, Fortran, PL/I, Cobol and
LISP, and having worked as a programmer and an operator in a number of operatinsystems environments has given me the background that CS 242 (Programming
Languages) was set up to give students. I also think that previous classes
might to the same for CS237 (Numerical Analysis), though I am not certain.
I talked to Jutta McCormick and she said that if you are familiar with those
courses, and feel I have had the appropriate material, you could initial
my checklist even though I have not had individual courses equivalent to
CS 242 and 237. I you are not familiar with those courses, she said that
I could talk to the teachers for the courses. She suggested Professor
Golub or Oliger for 237, and Prof. Linton for 242.
Would you like to set up a time for us to talk about the questions I have
concerning the coursework, or should I contact the other professors?
David
-------
∂12-Jan-87 1437 CLT blanks
put the following in you attach buffer
type αxredef
then type αy in line where you want to delete blanks
αsα β.αf¬ α⊗↔αl.α⊗↑αd
∂13-Jan-87 1004 VAL common.tex[e80,jmc]
Michael and I can't TeX it because jmcmac.tex[let,jmc] is protected. Can you
do it for us, please?
∂13-Jan-87 1006 SJG George Gratzer
... is a mathematician at Waterloo, who has taken an interest
in AI, but has been disappointed at the lack of formal material
available. I met him at a lattice theory workshop last week,
and told him that I'd try to get him some better stuff. Could
you send him a copy of the new circumscription paper? His whole
address is:
George Gratzer
U. of Manitoba
Winnipeg, Manitoba
Canada R3T 2N2
Hmm. Looking at it, I guess he's from Winnipeg instead of
Waterloo ...
Thanks.
Matt
∂13-Jan-87 1050 VAL
Now it complains that a ceratin font isn't loadable.
∂13-Jan-87 1059 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Jan 87 10:59:35 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Tue 13 Jan 87 10:55:51-PST
Date: Tue 13 Jan 87 10:57:14-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: AI Planning Retreat
To: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SUMEX-AIM.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: Haunga@SCORE.STANFORD.EDU, Puryear@SUMEX-AIM.STANFORD.EDU,
Richardson@SCORE.STANFORD.EDU, Gsmith@SUMEX-AIM.STANFORD.EDU,
Waleson@SUMEX-AIM.STANFORD.EDU
Message-ID: <12270643378.34.GSMITH@SUMEX-AIM.STANFORD.EDU>
I hope that your schedules have not changed drastically since you responded
to me regarding availability for the AI mini-retreat. The date which proved
to be convenient for everyone is Saturday, March 7, 1987. The retreat
will be held at the hostel at Hidden Villa Ranch, 26870 Moody Road, Los
Altos Hills, 9:30am - 4:30pm.
If this day is no longer convenient, please let me know immediately.
Thanks,
Grace
-------
∂13-Jan-87 1215 edsel!sunvalleymall!jlz@navajo.stanford.edu short bio please
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Jan 87 12:14:55 PST
Received: by navajo.stanford.edu; Tue, 13 Jan 87 12:13:00 PST
Received: from sunvalleymall.edsel.uucp by edsel.uucp (2.2/SMI-2.0)
id AA03074; Tue, 13 Jan 87 12:07:24 pst
Received: by sunvalleymall.edsel.uucp (1.1/SMI-3.0DEV3)
id AA04444; Tue, 13 Jan 87 12:06:15 PST
Date: Tue, 13 Jan 87 12:06:15 PST
From: edsel!sunvalleymall!jlz@navajo.stanford.edu (Jan Zubkoff)
Message-Id: <8701132006.AA04444@sunvalleymall.edsel.uucp>
To: navajo!jmc%sail.stanford.edu@navajo.stanford.edu
Cc: sunvalleymall!jlz@navajo.stanford.edu
Subject: short bio please
Dick received a letter from Janusz Kowalik from Boeing Computer
Services in Seattle, WA.
I need a short copy of your bio (1/4 - 1/2 page, double-spaced)
for the article on Qlisp to be featured in "Parallel Computation
and Computers for Artificial Intelligence."
Thanks!
---jan---
"edsel!sunvalleymall!jlz"@navajo.stanford.edu
Re: short bio please
[Reply to message sent: Tue, 13 Jan 87 12:06:15 PST]
Please give me an address to send JMC's short biography to.
Thanks,
Rutie
------
∂13-Jan-87 1432 RA Richard Schroeppel
Schroeppel called to let you know that the meeting is definitely on for Sat. ,
Jan 24, at 9:30. There will be a breakfast before it, if you want to join
the breakfast, please call him to let him know.
∂13-Jan-87 2019 ME PTYs
To: JMC, LES
There was a problem in some new code I had patched in. I've removed the
patch for now till I can fix it up, so now all the PTYs are back available
again. Let me know if you've seen any other problems. (The slowness of
the system was also a result of this patch and the PTY problem.)
∂13-Jan-87 2030 TEICH@Sushi.Stanford.EDU re: My degree plan
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Jan 87 17:41:04 PST
Date: Tue 13 Jan 87 17:35:32-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: re: My degree plan
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 12 Jan 87 13:17:00-PST
Message-ID: <12270715886.27.TEICH@Sushi.Stanford.EDU>
Ok, thanks for your time.
On a tangent -- I'm always interested in people's religious views. I have
a question, what made you decide on atheism? Are there things you feel prove
the non-existence of a god or are there other reasons? I'm always curious
because, as a strong agnostic, I always wonder what people use to make there
decisions in either direction.
david
-------
∂13-Jan-87 2041 oshea.pa@Xerox.COM re: video interview Wed 14th
Received: from XEROX.COM by SAIL.STANFORD.EDU with TCP; 13 Jan 87 14:23:04 PST
Received: from Semillon.ms by ArpaGateway.ms ; 13 JAN 87 14:02:55 PST
Date: Tue, 13 Jan 87 14:02:45 PST
From: oshea.pa@Xerox.COM
Subject: re: video interview Wed 14th
In-Reply-To: "JMC@SAIL.STANFORD.EDU's message of Mon, 5 Jan 87 16:33:00
PST"
To: John McCarthy <JMC@SAIL.STANFORD.EDU>
Message-ID: <870113-140255-6283@Xerox>
Just to confirm that we will be coming to film you in your Jordan Hall
office at 10.30 tomorrow.
Tim O'Shea
References
JMC@SAIL.STANFORD.EDU's message of Mon, 5 Jan 87 16:33:00 PST -- re:
Video lectures for new Xerox President
∂13-Jan-87 2141 TEICH@Sushi.Stanford.EDU re: My degree plan
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Jan 87 21:41:13 PST
Date: Tue 13 Jan 87 21:38:00-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: re: My degree plan
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 13 Jan 87 21:03:00-PST
Message-ID: <12270760027.7.TEICH@Sushi.Stanford.EDU>
Sounds good. I do tend towards existentialist a bit. And while I don't
see any evidence for the existence of a god, I don't see any evidence to
the contrary. My choice is just that it doesn't matter except in possibly
a theoretical sense, so I don't at all mind not knowing and choose
agnosticism.
Though I think I understand your belief, I do question your analogy.
Your disbelief of the elephant comes from physical and social knowledge
that tends to support your belief; while you just said that you do not have
any special evidence for the non-existence of a god. My previous concepts
of atheists was that most would see evidence, though not proof, that would
tend to make them believe in non-existence.
-------
∂13-Jan-87 2317 ME old files being restored
To: JMC
CC: ME
Joe says you asked to get some old files back from tape, and Rutie has
requested them via Pumpkin. Most likely, when they are restored, there
will be characters clobbered because our magtape interface is dropping
bits occasionally (for old magtapes, that is). We'll probably fix this
within the month, but I just want you to be aware of the problem. If
some character errors will be a problem, then let me know and maybe we
can get the interface fixed sooner so that you can try to get better
versions of the files back. Otherwise, maybe you can get by with most
of the data being correct.
∂14-Jan-87 0759 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Jan 87 07:59:15 PST
Date: Wed 14 Jan 87 07:54:08-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: AI Planning Retreat
To: GSMITH@SUMEX-AIM.Stanford.EDU
cc: Binford@Score.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
McCarthy@Score.Stanford.EDU, Rosenbloom@SUMEX-AIM.Stanford.EDU,
Winograd@Score.Stanford.EDU, Haunga@Score.Stanford.EDU,
Puryear@SUMEX-AIM.Stanford.EDU, Richardson@Score.Stanford.EDU,
Waleson@SUMEX-AIM.Stanford.EDU, NILSSON@Score.Stanford.EDU
In-Reply-To: <12270643378.34.GSMITH@SUMEX-AIM.STANFORD.EDU>
Message-ID: <12270872191.9.NILSSON@Score.Stanford.EDU>
I wll be away on Sat. March 7 but could make a retreat on Sunday
March 8. Care to try again? -Nils
-------
∂14-Jan-87 0903 RA video this morning
Oshea called and wanted to know whether you have any objections to their
filming you outside rather than inside. Please let me know and I'll call him
back.
∂14-Jan-87 0916 oshea.pa@Xerox.COM re: video interview Wed 14th
Received: from XEROX.COM by SAIL.STANFORD.EDU with TCP; 14 Jan 87 09:16:24 PST
Received: from Semillon.ms by ArpaGateway.ms ; 14 JAN 87 09:04:36 PST
Date: Wed, 14 Jan 87 9:04:30 PST
From: oshea.pa@Xerox.COM
Subject: re: video interview Wed 14th
In-Reply-To: "JMC@SAIL.STANFORD.EDU's message of Tue, 13 Jan 87 21:05:00
PST"
To: John McCarthy <JMC@SAIL.STANFORD.EDU>
Message-ID: <870114-090436-7168@Xerox>
We will present ourselves at Margaret Jacks.
Thank you.
References
JMC@SAIL.STANFORD.EDU's message of Tue, 13 Jan 87 21:05:00 PST -- re:
video interview Wed 14th
∂14-Jan-87 1018 GSMITH@SUMEX-AIM.STANFORD.EDU Re: retreat
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Jan 87 10:18:03 PST
Date: Wed 14 Jan 87 10:17:32-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: Re: retreat
To: JMC@SAIL.STANFORD.EDU
cc: GSMITH@SUMEX-AIM.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 14 Jan 87 10:08:00-PST
Message-ID: <12270898295.29.GSMITH@SUMEX-AIM.STANFORD.EDU>
Thanks for responding. I'll have to send out a msg. to the others to see if
they all want the 8th, or one of the other Saturdays I'd already asked about.
Grace
-------
∂14-Jan-87 1046 SJG question about Marek's "forcing" paper from the Mohonk workshop
To: JMC, VAL
Hi Guys:
Was this paper any good? It seems not to me, but I am having a lot
of trouble making much sense of it. John, I seem to remember that you
once told me that you found it disappointing; do I remember correctly?
Vladimir, I think Benjamin suggested I ask you about it.
Anyway, my interest is because one of the reviewers for the non-mon book
suggested that I include it. I'm not currently tempted to, but just
wanted to check that I wasn't making a big mistake.
Thanks much.
Matt
∂14-Jan-87 1120 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Jan 87 11:20:51 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Wed 14 Jan 87 11:17:18-PST
Date: Wed 14 Jan 87 11:20:04-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: AI Planning Retreat
To: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SUMEX-AIM.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: Haunga@SCORE.STANFORD.EDU, Puryear@SUMEX-AIM.STANFORD.EDU,
Richardson@SCORE.STANFORD.EDU, Gsmith@SUMEX-AIM.STANFORD.EDU,
Waleson@SUMEX-AIM.STANFORD.EDU
Message-ID: <12270909679.11.GSMITH@SUMEX-AIM.STANFORD.EDU>
Back to the drawing board since March 7th is out for Nils. The other Saturday
which was convenient for everyone involved is April 4. Does that still fit?
Grace
-------
∂14-Jan-87 1123 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Jan 16, 11:00
Place: 252 Margaret Jacks
Topic: Qlisp programming
∂14-Jan-87 1146 RICHARDSON@Score.Stanford.EDU Oliger/Winograd
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Jan 87 11:44:38 PST
Date: Wed 14 Jan 87 11:37:26-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Oliger/Winograd
To: binford@Whitney.Stanford.EDU, buchanan@SUMEX-AIM.Stanford.EDU,
feigenbaum@SUMEX-AIM.Stanford.EDU, rwf@Sail.Stanford.EDU,
golub@Score.Stanford.EDU, jlh@Sonoma.Stanford.EDU, dek@Sail.Stanford.EDU,
zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU, ejm@Shasta.Stanford.EDU,
papa@Score.Stanford.EDU, pratt@Navajo.Stanford.EDU,
ullman@Score.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12270912842.12.RICHARDSON@Score.Stanford.EDU>
I'd like to remind all full professors to stop by my office prior to the
faculty meeting on Jan. 27 to read through the Oliger and Winograd letters
that we have received.
Thanks,
Anne
-------
∂14-Jan-87 1242 RA Susan
Please call Susan (214) 595 6036
∂14-Jan-87 1245 RA [Reply to message recvd: 14 Jan 87 12:27 Pacific Time]
No. We didn't get it yet. I talked to Josh (apparently his assistent) last
week and he told me I would get it the following day, but so far, nothing.
∂14-Jan-87 1456 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
NEW RESULTS ON TIME MODELLING WITH INTERVALS
Peter Ladkin
Kestrel Institute
(ladkin@kestrel.arpa)
Thursday, January 15, 4pm
Bldg. 160, Room 161K (NEW PLACE!)
James Allen introduced a calculus for reasoning about time using
intervals, instead of points. In this talk, we shall indicate two
new results for time modelling using intervals, and indicate why
they help overcome some of the objections to using an interval system
for reasoning about time. Much of this work is joint with Roger
Maddux. Briefly, we have shown that there is only one countable
representation of the calculus, up to isomorphism, and that the
system of time units introduced in [Ladkin AAAI-86] is isomorphic
to this countable representation.
∂14-Jan-87 1523 VAL trip to Washington
I asked Rutie to reserve a hotel for me and she said the place where you'd be
staying is expensive. Would you like me to find another place for myself?
I'll need a room for 2 nights.
∂14-Jan-87 1550 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU thanks
Received: from UCBVAX.Berkeley.EDU by SAIL.STANFORD.EDU with TCP; 14 Jan 87 15:50:34 PST
Received: by ucbvax.Berkeley.EDU (5.53/1.20)
id AA07476; Wed, 14 Jan 87 15:50:58 PST
Received: by ucscc (5.51/4.7)
id AA24174; Wed, 14 Jan 87 15:50:10 PST
Received: by ucscd (5.51/4.7)
id AA10355; Wed, 14 Jan 87 15:50:15 PST
Date: Wed, 14 Jan 87 15:50:15 PST
From: ucscc!ucscd.beeson@ucbvax.Berkeley.EDU (20012000)
Message-Id: <8701142350.AA10355@ucscd>
To: jmc@sail.stanford.edu@ucbvax.Berkeley.EDU
Subject: thanks
I received the copy of the emigres' letter today. Note that point 3
of the emigres' letter says that the emigres believe that the Soviet
Union plans to use their Star Wars system offensively, i.e. to
"by coercion usher in the `final historic era'..."
Weinberger told Congress a couple of days ago that the SDI is
planning to use space-based kinetic-energy weapons for a
continental defense in the early 1990's. The chairman of the
committee, Sam Nunn, indicated disbelief, saying, "He's just
talking politics".
If Weinberger was telling the truth, why didn't the SDI representatives
at that debate say SDI was still considering space-based weapons?
Military secrecy? You see, it's hard to put together any coherent
view of the subject when you can't get your premises to stand still
for a month at a time.
∂15-Jan-87 0036 LES Timesharing Memo
Your notes in TIMESH[W83,JMC] do not give the title of your '59 memo on
timesharing. If it is unknown, perhaps we should use the '62 book
reference.
∂15-Jan-87 0802 @Score.Stanford.EDU:FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 08:02:04 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Thu 15 Jan 87 07:58:32-PST
Date: Thu 15 Jan 87 08:01:51-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: AI Planning Retreat
To: NILSSON@SCORE.STANFORD.EDU, GSMITH@SUMEX-AIM.STANFORD.EDU
cc: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Genesereth@SUMEX-AIM.STANFORD.EDU, McCarthy@SCORE.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU,
Haunga@SCORE.STANFORD.EDU, Puryear@SUMEX-AIM.STANFORD.EDU,
Richardson@SCORE.STANFORD.EDU, Waleson@SUMEX-AIM.STANFORD.EDU
In-Reply-To: <12270872191.9.NILSSON@Score.Stanford.EDU>
Message-ID: <12271135738.24.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Grace, although I could make it on Apr. 4, I would prefer March 8.....Ed
-------
∂15-Jan-87 0807 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 08:07:34 PST
Date: Thu 15 Jan 87 08:03:50-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: AI Planning Retreat
To: GSMITH@SUMEX-AIM.Stanford.EDU
cc: Binford@Score.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
McCarthy@Score.Stanford.EDU, Rosenbloom@SUMEX-AIM.Stanford.EDU,
Winograd@Score.Stanford.EDU, Haunga@Score.Stanford.EDU,
Puryear@SUMEX-AIM.Stanford.EDU, Richardson@Score.Stanford.EDU,
Waleson@SUMEX-AIM.Stanford.EDU, NILSSON@Score.Stanford.EDU
In-Reply-To: <12270909679.11.GSMITH@SUMEX-AIM.STANFORD.EDU>
Message-ID: <12271136099.16.NILSSON@Score.Stanford.EDU>
April 4 for the AI retreat is fine with me. -Nils
-------
∂15-Jan-87 0853 AI.BOYER@MCC.COM Stallman Course
Received: from MCC.COM by SAIL.STANFORD.EDU with TCP; 15 Jan 87 08:51:40 PST
Date: Thu, 15 Jan 1987 10:49 CST
Message-ID: <AI.BOYER.12271144345.BABYL@MCC.COM>
From: AI.BOYER@MCC.COM
To: jmc@su-ai
Subject: Stallman Course
Richard Stallman is giving a week-long course here on Gnu
Emacs, his Lisp based system for editing, interfacing to
Unix, etc. It will occupy the whole of the week beginning
February 2. Since you have spoken often of doing an editor
based operating system, and since Stallman's whole Gnu
project is the closest thing to it that I know about, I
thought you just might want to attend.
∂15-Jan-87 0857 RICHARDSON@Score.Stanford.EDU AI Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 08:57:02 PST
Date: Thu 15 Jan 87 08:53:32-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: AI Faculty Meeting
To: ai.list: ;
Message-ID: <12271145148.10.RICHARDSON@Score.Stanford.EDU>
This is a reminder that there will be an AI faculty meeting on Friday,
Jan. 16 from 3:00 - 5:00 in MJH 220.
-------
∂15-Jan-87 0920 RA
John,
This is the msg I got from the pumpkin re your files. You now have
shed[1,jmc].
Tape File Status
P343 BOOKS[1,RA]←BOOKS[R,WD] Not found on tape
P376 SHED[1,RA]←SHED[R,WD] Restored
∂15-Jan-87 0956 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 09:56:37 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Thu 15 Jan 87 09:42:22-PST
Date: Thu 15 Jan 87 09:44:03-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: AI Planning Retreat
To: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SCORE.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: Haunga@SUMEX-AIM.STANFORD.EDU, Puryear@SUMEX-AIM.STANFORD.EDU,
Richardson@SCORE.STANFORD.EDU, Waleson@SUMEX-AIM.STANFORD.EDU,
Gsmith@SUMEX-AIM.STANFORD.EDU
Message-ID: <12271154345.47.GSMITH@SUMEX-AIM.STANFORD.EDU>
April 4 is not a convenient time for one person. Can everybody make it on
Sunday, March 8?
Grace
-------
∂15-Jan-87 1008 RA Provost invitation
Jeany from the Provost office called to find out whether you got the invitation
to the Provost house for Jan. 22. If you did, do you intend to attend. You
can call her 3-0788 or let me know and I will call her.
∂15-Jan-87 1201 RA your interview
Which file would you like the questions and answers of your interview to go?
∂15-Jan-87 1234 SCHAFFER@sushi.stanford.edu Tentative Visit Dates
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 12:34:06 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 15 Jan 87 12:32:53 PST
Date: Wed 14 Jan 87 20:53:46-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Tentative Visit Dates
To: fndsch@navajo.stanford.edu
Message-Id: <12271014118.13.SCHAFFER@Sushi.Stanford.EDU>
Joel Friedman will visit on February 19 (tentatively) and talk that day
at AFLB on his work concerning the convergence of Newton's method for
polynomials.
Daniel Sleator will visit on February 26-27 and talk at AFLB on the
26th either about amortized analysis of algorithms or about
persistent data structures.
Richard Cole will visit around Tuesday March 3 (tentatively). Professor
Mayr will set up the exact dates. Cole wants to talk about his FOCS 1986
paper on parallel merging. Presumably we could have it at 12:30PM. Once
I know the date(s) I'll set a time and room for the talk.
John Mitchell will visit around Tuesday March 10 (tentatively). Professor
Pratt will set up the exact dates. Either he or I can set the room and
time for a talk.
When do we meet again to discuss Landau, Maley, Mulmuley, Schieber?
Have any more applications come in?
Alex
-------
∂15-Jan-87 1245 SCHAFFER@sushi.stanford.edu Tentative Visit Dates
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 12:36:06 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 15 Jan 87 12:34:45 PST
Date: Thu 15 Jan 87 11:08:17-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Tentative Visit Dates
To: fndsch@navajo.stanford.edu
Message-Id: <12271169678.44.SCHAFFER@Sushi.Stanford.EDU>
I sent out this message last night, but it seems to have not made it to
Navajo, so I'll try again.
Joel Friedman will visit on Thursday 19 February (tentatively). He will
speak at AFLB that day on his work concerning the convergence of Newton's
method for polynomials.
Daniel Sleator will visit on Thursday 26 February and either the 25th or 27th
or both. He will speak at AFLB on the 26th.
Richard Cole will visit around Tuesday March 3 (tentatively). Professor
Mayr will confirm the exact dates.
John Mitchell will visit around Tuesday March 10 (tentatively). Professor
Pratt will confirm the dates.
When do we meet again to discuss Landau, Maley, Mulmuley, Schieber?
Have any more applications come in?
Alex
-------
∂15-Jan-87 1316 AI.BOYER@MCC.COM Stallman Course
Received: from MCC.COM by SAIL.STANFORD.EDU with TCP; 15 Jan 87 13:16:41 PST
Date: Thu, 15 Jan 1987 15:16 CST
Message-ID: <AI.BOYER.12271193056.BABYL@MCC.COM>
From: AI.BOYER@MCC.COM
To: John McCarthy <JMC@SAIL.STANFORD.EDU>
Subject: Stallman Course
In-reply-to: Msg of 15 Jan 1987 14:18-CST from John McCarthy <JMC at SAIL.STANFORD.EDU>
Sure. Here is a message for Rabinov and you to read.
This message is being sent to all those who responded to my
query about interest in the course Stallman is going to give
on Gnu Emacs in February to MCC people. There are about 36
of you, listed in mcc:<ai.boyer>gnu-emacs-course.list.
It still looks like the Gnu Emacs course is going to happen.
The course will take up all of the week of February 2 -
February 6. It will take place in my house, 614 W. 32nd, in
Austin, just northwest of UT, where I have a seminar room
with blackboard, overhead projector, Sun-3, and laser
printer. We've managed to seat 25, though it's most
comfortable with about 15. After you finish reading this
message, I doubt that more than 15 of you will come. If you
tell anyone that you are going to be at my house that week,
please tell them not to call except in case of a family
emergency. I want to have the benefit of a fairly isolated
and interrupt free atmosphere without the major expense and
family disruption of holding the course out of town.
I do not have any idea what the agenda will be, beyond the
list that I got from Stallman and circulated to you. I
would like us to begin around 9am each day. I myself find
it hard to listen to more than a couple of hours of lectures
at a stretch. But I hope we can have a good bit of
interaction and maybe even some experimentation between the
lectures. Personally, I hope that the sessions are largely
driven by whatever the audience is most interested in
talking about.
This will be a course for people who want to use Gnu Emacs
in a serious way in system development. It is NOT for
novices who just want to learn to use the ordinary set of
EMACS commands a little better. If you are not a competent
Lisp programmer, you probably shouldn't attend. If you are
not already using Gnu Emacs and making minor extensions to
it (or wishing you could), you probably shouldn't attend.
(That's Gnu Emacs, not just Emacs, as it exists for example
on Dec 2060s and Lisp Machines. I along with many other
people at MCC use Gnu Emacs on Suns, but it runs on many
other machines, too.) If you can't afford to devote most of
a week to this class, you probably shouldn't attend.
I do not intend to impose any restrictions on which of you
may attend. However, I do make the following requests of
you. (You don't have to comply with any request but the
first.)
0. MOST IMPORTANTLY, understand that Stallman is NOT
signing any sort of nondisclosure agreement or intellectual
property agreement. It is entirely your responsibility to
keep MCC confidential and proprietary information to yourself
during this course.
1. Make sure that your supervisor knows that this is a week
long event.
2. Ask your supervisor for a contribution, say $500
tuition. We're paying Stallman $10,000 plus expenses out of
the AI/ISA budget, but I wouldn't mind getting some of that
reimbursed from other projects. If your supervisor says no,
you can still come. But I suspect that if your supervisor
can spare you for a week, he can spare $500, too.
3. Ask yourself whether you'd be interested in putting
Stallman up. He'd prefer to stay in someone's house to
staying in a hotel, not only to avoid the expenditure of MCC
money but also because he doesn't care much for hotels.
4. Ask yourself whether you can contribute a tape recorder.
Stallman may get his lectures transcribed for the benefit
of others.
5. Finally, prepare yourself mentally for Richard Stallman
by reading the rest of this message. If it offends you,
you probably don't want to come to the course.
*******************************************************************
The rest of this message is Stallman speaking in the first
person, not Bob Boyer!!!!
*******************************************************************
I have to warn you that Texans have been known to have an adverse reaction
to my bizarre opinions.
A few years ago I went to TI to teach courses on how the Lisp machine
system internals work. At lunch on the second day, the boss of the
group came to me, chatted for a while in a way that seemed strangely
aimless, and then told me that a design review of the entire project
had been scheduled for the following day. "No one will be able to
come to your classes."
"Well, I had better work out now which topics are the most important
to cover this afternoon."
"It's worse than that. No one will be available to take you to the
airport either, so we have to switch your flight to this afternoon."
I said ok, especially since he then gave me a check for more than I
had expected for the time originally planned.
The next week I phoned and asked about arrangements future visits for
more lectures. Before my trip, they expected to want more than one.
Having missed part of the first series, they would naturally want them
sooner than planned. But the the boss said, "As things stand now,
I'm not sure when we would have time for you."
I thought about this, and the unexpected size of the check. Was he
ashamed? "I think you aren't telling me the real reason. I think you
found something you didn't like and you don't want to do business with
me. I'd rather you told me what it is. Were my lectures
unsatisfactory?"
"Yes, you're right, but it wasn't your lectures. It was the people
who had dinner with you. Both evenings they were very uncomfortable
with you. They said they didn't want to have you around any more."
"Uncomfortable? But they didn't say so. Did they say why?"
"One of them said he was upset when you talked about nasal sex with
plants." I had actually demonstrated this perverse act with
the bouquet on the table, at dinner the night before.
That was the end of the conversation, but I never forgot that the
worst bunch of cowards I ever met were Texans. I can just imagine them:
"Chief, you gotta get that guy away from here! All his crazy
ideas are making my head feel strange. Is he a hippy?"
I have a suspicion that I didn't put them any more at ease when I
started the first lecture by leading everyone in a Bulgarian folk
dance. Perhaps this raised questions in their minds about my
affiliation with foreign powers.
I have another suspicion. It's hard for me to believe even a Texan
would be that worried about preserving the innocence of plants.
Perhaps his pious concern was yet another front. But for what?
Was it because I told the Symbolics repairman to tell Noftsker
that I was Noftsker's nemesis and I would put him out of business?
Alas, in the study of alien civilizations, we find many clues and
few answers.
∂15-Jan-87 1346 RA Robert Jastrow
Please call him at (202) 328 5470
∂15-Jan-87 1347 RA windows in your office
Someone will come this afternoon to solve the problem of the leaking windows.
∂15-Jan-87 1427 MAYR@score.stanford.edu visits
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 14:27:25 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 15 Jan 87 14:25:59 PST
Date: Thu 15 Jan 87 14:23:10-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: visits
To: fndsch@navajo.stanford.edu
Message-Id: <12271205155.31.MAYR@Score.Stanford.EDU>
Richard Cole from NYU will visit Monday, Feb. 9, all day. He'll give a
talk on "Parallel Merge Sort", exact time and location still to be arranged.
Please let me know asap when you'd like to meet with him. Maybe it's a good
idea to schedule his talk in the morning at 11am (10am ?) so that he doesn't
have to explain this to everybody he sees before his talk!
-ernst
PS: I haven't gotten any response yet from Joel Friedman, so Feb. 19 is still
very tentative!
-------
∂15-Jan-87 1454 RA leaving at 4:00
It's Thursday and I am leaving at 4:00, is there anything you want me to do
before I leave?
∂15-Jan-87 1500 VAL
Seminar in Room 161K, Bldg. 160.
∂15-Jan-87 1545 CHEADLE@Score.Stanford.EDU Gray Tuesday
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 15:45:04 PST
Date: Thu 15 Jan 87 15:08:32-PST
From: Victoria Cheadle <CHEADLE@Score.Stanford.EDU>
Subject: Gray Tuesday
To: Kaelbling@SRI-STRIPE.ARPA
cc: jmc@Sail.Stanford.EDU
Office: Margaret Jacks 258, 723-1519
Message-ID: <12271213416.51.CHEADLE@Score.Stanford.EDU>
The Computer Science Department faculty met on December 16, 1986,
to evaluate the progress of each of our PhD students. This was
the first of two meetings held this year. Our next evaluation
meeting, Black Friday, is tentatively scheduled to be held on
Tuesday, June 2nd, 1987.
The purpose of the meetings is to ensure that all PhD students
are making ``reasonable progress'' towards completion of the
degree. The first meeting is intended to detect potential
problems, to alert advisors and other appropriate faculty to
those problems, and to initiate corrective action if possible.
Students are expected to correct problems by the second meeting.
During the meeting records of each student are checked for accuracy
and completeness. If you have any questions about your records, see
Victoria Cheadle (the Ph.D. Program Administrator). Each student's
progress is compared to the timetable which defines ``reasonable
progress'' toward the PhD. (Copies of the ``Requirements in the PhD
Program'' are available from Victoria Cheadle.) Subjective opinions
are expressed on how each student is doing. Comments from the
student's advisor and from other appropriate faculty members are
solicited. If you have any questions about this letter, please see
your advisor or Victoria Cheadle.
I would like to remind you that continuous registration is a
requirement of the PhD program. You must be registered every quarter
except summer, unless you have officially been granted leave of
absence. I would also like to remind you, that under the new
requirements for the Ph.D. program, every student (where appropriate)
is required to meet with his full committee at least once a year; we
expect this to take place before the next evaluation meeting (June 2,
1987). Lastly, please remember it is recommended that students
complete one-half of the Teaching Requirement by the end of their
second year. If you haven't done so, please plan accordingly.
Just to make sure our records are up to date, let me show you the
basic information we have on file about you (Note: We still do not have in
place the programming needed to accomodate the ``new'' teaching requirement
for those who entered 1-84 and after):
Kaelbling, Leslie P. Advisor: McCarthy PhD Entry: 1-84
Comp Writ: Pass Comp Prog: Pass Quarter: 3.5
Qual: AI , Cond Pass Qual Qtr.: 3-85 Honors Coop: SRI
Teach (%): 50 Cand Begin: 1-86 Cand End: 1-91
COMP 3-82 MS PASS
COMP 2-84 MS PASS WRITTEN
COMP 3-84 PHD PASS WRITTEN
COMP 4-85 PHD PASS PROGRAM
QUAL 3-85 CONDITIONAL PASS AI --See folder for details.
Since you are an Honors Co-op student, your departmental clock proceeds
at half-speed. Please keep this in mind when satisfying requirements.
As you know, you received a Conditional Pass on last Spring's AI qual.
Because the committee was concerned about your ability to relate other
people's work to your own you were asked, as part of your thesis
proposal, to do a careful job of relating other work to your proposed
area of research. We expect that you will have accomplished this goal
by the Black Friday meeting (June 2, 1987). Please see your advisor
or Victoria Cheadle if you have any questions regarding this matter.
Sincerely,
Nils Nilsson
Chairman
-------
∂15-Jan-87 1555 YOUNG@Sushi.Stanford.EDU re: CS326 Grade Change
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 15:55:18 PST
Date: Thu 15 Jan 87 15:51:55-PST
From: Michael Young <YOUNG@Sushi.Stanford.EDU>
Subject: re: CS326 Grade Change
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 8 Jan 87 00:51:00-PST
Message-ID: <12271221312.42.YOUNG@Sushi.Stanford.EDU>
John,
I checked with the Registrar's Office to see if they would approve
a grade change for CS326. Since the course was only offered P/NC at the
time, in order for you to change my grade you would have to change
the grade of everyone else who took the class that quarter.
Oh well. Thanks anyway.
-Michael
-------
∂15-Jan-87 1557 CHEADLE@Score.Stanford.EDU Gray Tuesday
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Jan 87 15:57:02 PST
Date: Thu 15 Jan 87 15:20:19-PST
From: Victoria Cheadle <CHEADLE@Score.Stanford.EDU>
Subject: Gray Tuesday
To: JJW@Sail.Stanford.EDU
cc: jmc@Sail.Stanford.EDU, RPG@Sail.Stanford.EDU, ullman@Score.Stanford.EDU
Office: Margaret Jacks 258, 723-1519
Message-ID: <12271215560.45.CHEADLE@Score.Stanford.EDU>
The Computer Science Department faculty met on December 16, 1986,
to evaluate the progress of each of our PhD students. This was
the first of two meetings held this year. Our next evaluation
meeting, Black Friday, is tentatively scheduled to be held on
Tuesday, June 2nd, 1987.
The purpose of the meetings is to ensure that all PhD students
are making ``reasonable progress'' towards completion of the
degree. The first meeting is intended to detect potential
problems, to alert advisors and other appropriate faculty to
those problems, and to initiate corrective action if possible.
Students are expected to correct problems by the second meeting.
During the meeting records of each student are checked for accuracy
and completeness. If you have any questions about your records, see
Victoria Cheadle (the Ph.D. Program Administrator). Each student's
progress is compared to the timetable which defines ``reasonable
progress'' toward the PhD. (Copies of the ``Requirements in the PhD
Program'' are available from Victoria Cheadle.) Subjective opinions
are expressed on how each student is doing. Comments from the
student's advisor and from other appropriate faculty members are
solicited. If you have any questions about this letter, please see
your advisor or Victoria Cheadle.
I would like to remind you that continuous registration is a
requirement of the PhD program. You must be registered every quarter
except summer, unless you have officially been granted leave of
absence. I would also like to remind you, that under the new
requirements for the Ph.D. program, every student (where appropriate)
is required to meet with his full committee at least once a year; we
expect this to take place before the next evaluation meeting (June 2,
1987). Lastly, please remember it is recommended that students
complete one-half of the Teaching Requirement by the end of their
second year. If you haven't done so, please plan accordingly.
Just to make sure our records are up to date, let me show you the
basic information we have on file about you (Note: We still do not have in
place the programming needed to accomodate the ``new'' teaching requirement
for those who entered 1-84 and after):
Weening, Joseph S. Advisor: McCarthy PhD Entry: 1-80
Comp Writ: Pass Comp Prog: Pass Quarter: 19
Qual: MTC, Pass Qual Qtr.: 1-82
Teach (%): 50 Cand Begin: 1-82 Cand End: 1-87
G81: 3-83 Seminar: 1-85
Dissertation: Parallel Execution of LISP Programs
Readers: McCarthy, Gabriel, Ullman
COMP 2-80 PHD PASS WRITTEN
COMP 1-82 PHD PASS PROG
EVAL 2/01/1982 Programming project.
EVAL 6/01/1982 Needs programming project by summer.
EVAL 2/01/1983 Needs G81 by 11/83
EVAL 6/27/1986 Expect solid proposal by Autumn 86-87 or Hold reg.
EVAL 10/01/1986 Hold released.
QUAL 1-81 FAIL MTC
QUAL 1-82 PASS MTC
I'm happy to report that it was felt at the meeting that you are
making satisfactory progress toward your degree. It was noted
that your candidacy will expire at the end of Autumn Quarter
1987-88; we encourage you to complete your thesis by that time.
Sincerely,
Nils Nilsson
Chairman
-------
∂16-Jan-87 0814 RICHARDSON@Score.Stanford.EDU Jean-Claude Latombe
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 08:14:08 PST
Date: Fri 16 Jan 87 08:10:29-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Jean-Claude Latombe
To: robotics.list: ;
Message-ID: <12271399455.10.RICHARDSON@Score.Stanford.EDU>
***********************************************************************
You are cordially invited to a reception on Tuesday, January 20 at 5:30
in Cedar Hall to welcome Associate Professor Jean-Claude Latombe to the
Computer Science Department. (Though he will actually be joining the
department in April - he will be visiting with us next week to meet
various people and to make final arrangements for his move from France.)
***********************************************************************
-------
∂16-Jan-87 0958 SCHAFFER@sushi.stanford.edu Publicisizing Cole's Talk/Visit
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 09:57:40 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Fri, 16 Jan 87 09:56:23 PST
Date: Fri 16 Jan 87 09:53:44-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Publicisizing Cole's Talk/Visit
To: fndsch@navajo.stanford.edu
Message-Id: <12271418250.9.SCHAFFER@Sushi.Stanford.EDU>
I remember that in Cole's application letter he states that he would like
to make sure his department does not know of his application here.
Should this affect how we publicisize his talk/visit?
I was planning to post notices on the su-events and csd bboards, to
send messages to aflb.all and phd, and to announce it on the
departmental weekly seminar calendar. There are people at NYU on
aflb.all .
Alex Schaffer
-------
∂16-Jan-87 1014 coraki!pratt@sun.com Mitchell on March 10
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 10:13:57 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Fri, 16 Jan 87 10:12:44 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA01047; Fri, 16 Jan 87 10:12:57 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA08951; Fri, 16 Jan 87 10:12:39 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA01008; Fri, 16 Jan 87 10:13:35 PST
Date: Fri, 16 Jan 87 10:13:35 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8701161813.AA01008@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell on March 10
Turns out Mitchell has already left for POPL, I'll see him there and
firm up the date but won't be reporting back on the outcome till Jan. 31.
However it's pretty likely the talk will March 10. It would be
reasonable to make it a CS459 talk (my concurrency semantics course,
which meets at 1:45 pm).
-v
∂16-Jan-87 1039 TAJNAI@Score.Stanford.EDU Logistics of annual meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 10:39:28 PST
Date: Fri 16 Jan 87 10:33:03-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Logistics of annual meeting
To: Forum-Speakers: ;
Message-ID: <12271425409.19.TAJNAI@Score.Stanford.EDU>
This message is being sent to speakers, session chairmen, and
faculty advisors of student speakers.
Session Chairmen:
If at all possible, we recommend that you hold a dry-run with
your group. It is your responsibility to control the timing,
i.e., start on time, each speaker gets his fair share of time,
and you finish on time. If there is a faculty member speaking in
your session, it is your responsibility to introduce him.
Advisors:
It is your responsibility to introduce your advisee, or get a
substitute (and let me know). Tom Binford
is both Session Chairman of Technical Session I A and advisor to
all the speakers. Therefore, he will introduce the speakers as
well as "run the show". Speakers are allowed 20 minutes including
introduction and questions/answers. Perhaps a 2 minute introduction
per student is appropriate. If you are introducing several students,
you might use less time per intro.
Speakers:
Be sure to let us know in plenty of time what your visual needs are.
Send message to macmilk@score. This is your opportunity to present
your work to Forum visitors from approximately 70 companies
representing the US, Germany, Italy, France, the Netherlands, and Japan.
Let's put on a great program!!
Thanks for your participation. Remember "WE are the Forum".
Carolyn Tajnai
-------
∂16-Jan-87 1121 coraki!pratt@sun.com Publicisizing Cole's Talk/Visit
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 11:21:39 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Fri, 16 Jan 87 11:20:13 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA00289; Fri, 16 Jan 87 11:20:27 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA10066; Fri, 16 Jan 87 11:20:08 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA01205; Fri, 16 Jan 87 11:20:00 PST
Date: Fri, 16 Jan 87 11:20:00 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8701161920.AA01205@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Publicisizing Cole's Talk/Visit
I remember that in Cole's application letter he states that he
would like to make sure his department does not know of his
application here.
Stanford is somewhat more upfront than some institutions about which of
their visiting speakers are being considered for a job, e.g. the
meeting(s!) with students. Besides that however, there should be no
necessity for outsiders to construe the talk or the visit as anything
more than the usual guest presentation. (As with cryptography, one
cannot say as much for the possibility of their doing so since we do
not as yet have thought police.)
-v
∂16-Jan-87 1135 edsel!sunvalleymall!jlz@navajo.stanford.edu Qlisp meeting 1/23 change
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 11:35:00 PST
Received: by navajo.stanford.edu; Fri, 16 Jan 87 11:34:04 PST
Received: from sunvalleymall.edsel.uucp by edsel.uucp (2.2/SMI-2.0)
id AA02323; Fri, 16 Jan 87 11:16:27 pst
Received: by sunvalleymall.edsel.uucp (1.1/SMI-3.0DEV3)
id AA03582; Fri, 16 Jan 87 11:14:57 PST
Date: Fri, 16 Jan 87 11:14:57 PST
From: edsel!sunvalleymall!jlz@navajo.stanford.edu (Jan Zubkoff)
Message-Id: <8701161914.AA03582@sunvalleymall.edsel.uucp>
To: navajo!clt%sail.stanford.edu@navajo.stanford.edu,
navajo!jmc%sail.stanford.edu@navajo.stanford.edu
Cc: sunvalleymall!jlz@navajo.stanford.edu
Subject: Qlisp meeting 1/23 change
Someting has come up for Dick. He can make it any time on
Thursday 1/22, Tues 1/27, Wed 1/28, Fri 1/30
Sorry for the inconvenience.
---jan---
∂16-Jan-87 1232 RA lunch
I am going out for lunch.
∂16-Jan-87 1501 LES One-page Biography
[Here is the thing that I put together to meet the peculiar formatting
requirements for the chair proposal. -Les]
John McCarthy--Professor of Computer Science
Born: September 4, 1927, Boston, Massachusetts. Education: B.S.
(Math.), 1948, Caltech; Ph.D. (Math.), 1951, Princeton University.
Professional Experience: 1962-present, Professor, Stanford University;
1961-62, Associate Professor, 1958-61 Assistant Professor, M.I.T.;
1955-58, Assistant Professor, Dartmouth College; 1953-55, Acting
Assistant Professor, Stanford University; 1951-53, Instructor,
Princeton University. Major Publications: Circumscription - a Form
of Non-monotonic Reasoning (1980); First Order Theories of Individual
Concepts and Propositions (1979); Some Philosophical Problems from
the Standpoint of Artificial Intelligence (1969); A Basis for a
Mathematical Theory of Computation (1963); Programs with Common
Sense (1960); Recursive Functions of Symbolic Expressions and their
Computation by Machine (1960); A Time Sharing Operator Program for
our Projected IBM 709 (1959).
Professor McCarthy's main research interests lie in artifical
intelligence, a field that he named and helped found. Much of his effort
has been aimed at developing common sense reasoning capabilities in
computers. He has played a central role in developing sound theoretical
foundations for this work, most recently in his explorations of
circumscription, a form of non-monotonic reasoning that seems to model
human reasoning processes in important ways.
He was the principal creator of the LISP programming language, which
introduced many new ideas to computer science. It is the second oldest
programming language, after FORTRAN. It has become the foundation for
most work in artificial intelligence and there is now a substantial
industry devoted to developing LISP systems and application programs for
governmental and commercial use.
He was the first person to describe the concept of a general purpose
timesharing computer system and was the first to create one. This work
gave birth to a multi-billion dollar world-wide industry.
He laid the foundations for a mathematical theory of computation, which
permits the writing of specifications for programs in languages of
mathematical logic and permits formal computer-checked proofs that
programs meet their specifications.
He was co-founder of the M.I.T. Artifical Intelligence Project and later
founded the Stanford Artificial Intelligence Laboratory. Both
organizations pioneered in a number of branches of artificial
intelligence, including visual perception, robotics, and speech
understanding.
The 1971 A.M. Turing award was given to Professor McCarthy by the
Association for Computing Machinery in recognition of his contributions to
computer science. He was 1983-84 president of the American Association
for Artificial Intelligence, has been on the editorial board of the
Artificial Intelligence Journal since its inception, and is a member of a
number of professional and honorary societies.
∂16-Jan-87 1656 EPPLEY@Score.Stanford.EDU Phone
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Jan 87 16:54:26 PST
Date: Fri 16 Jan 87 16:50:56-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: Phone
To: JMC@Sail.Stanford.EDU
cc: Eppley@Score.Stanford.EDU
Message-ID: <12271494200.24.EPPLEY@Score.Stanford.EDU>
Les has indicated to me that you are not happy with the new ET and would
prefer to go back to the Link+4. If this is true, I will take care of
the paperwork. ITS will do this at no charge since they were in error
in giving us the information about Rutie's phone. Please let me know.
Thanks
LaDonna
-------
∂17-Jan-87 0728 coraki!pratt@sun.com Breazu-Tannen
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Jan 87 07:28:10 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Sat, 17 Jan 87 06:24:00 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA00711; Fri, 16 Jan 87 22:48:55 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA06149; Fri, 16 Jan 87 22:48:37 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA01646; Fri, 16 Jan 87 22:49:26 PST
Date: Fri, 16 Jan 87 22:49:26 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8701170649.AA01646@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Breazu-Tannen
We now have a letter for Val Breazu-Tannen, an extremely strong one
from Albert Meyer, which is more or less in line with my brief
impression of Val from LICS-86. Hopefully when I get back on
January 31 we will have another letter or two.
-v
∂17-Jan-87 0728 SCHAFFER@sushi.stanford.edu Visits less tentative
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Jan 87 07:28:39 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Sat, 17 Jan 87 06:36:35 PST
Date: Fri 16 Jan 87 15:52:41-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Visits less tentative
To: fndsch@navajo.stanford.edu
Message-Id: <12271483596.7.SCHAFFER@Sushi.Stanford.EDU>
Cole will visit on 9 February.
Friedman will visit on 19 February.
Sleator will visit on 26 February and at least one other day -- either 25
or 27.
Mitchell will visit (tentatively still!) on 10 March. We won't have more
definite information on this until Professor Pratt comes back from
POPL where he will meet with Mitchell.
When do we meet to discuss Landau, Maley, Mulmuley, Schieber and any others?
Alex
-------
∂17-Jan-87 0856 JJW Multilisp papers
To: Qlisp@SAIL.STANFORD.EDU
Let me know if you would like copies of the following papers:
Multilisp: A Language for Concurrent Symbolic Computation
ACM TOPLAS, October 1985 (38 pages)
Exception Handling in Multilisp
Preprint, February 1985 (14 pages)
The Multilisp Manual
June 1986 (100 pages)
∂17-Jan-87 1030 guibas@decwrl.dec.com next meeting, Thursday 1/22, 1:45 pm
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Jan 87 10:28:40 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Sat, 17 Jan 87 10:27:27 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA10721; Sat, 17 Jan 87 10:28:35 PST
Received: from jumbo.dec.com by src.dec.com (5.54.3/4.7.34)
id AA05583; Sat, 17 Jan 87 10:28:29 PST
Received: by jumbo.dec.com (1.2/4.7.34)
id AA04523; Sat, 17 Jan 87 09:40:10 pst
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8701171740.AA04523@jumbo.dec.com>
Date: 17 Jan 1987 0940-PST (Saturday)
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: next meeting, Thursday 1/22, 1:45 pm
Let's have a second (short!) meeting to discuss the other promising
candidates. In MJH 352, unless you hear from me otherwise.
L.
∂17-Jan-87 1820 LES Formal Reasoning tight budget
Here is a tighter version of the formal reasoning budget based on:
(1) shortening the duration of the project from three years to two,
(2) eliminating all unnamed personnel,
(3) reducing Shoham to 1/2 of full support (assuming that Nilsson or
some other source will cover the other half),
(4) reducing Calolyn to 25%, given that she is in the Qlisp butget at
100%,
(5) eliminating support for me.
(6) scaling down some of the ancillary expenses such as computer time.
As you can see, this cuts the annual budget almost in half and cuts the
overall total to about 1/3. If you would like to see any other versions,
let me know.
Proposal to DARPA
for
Research in Formal Reasoning
Budget for Two Years beginning 1 April 1986
Personnel Annual Cost
Prof. John McCarthy (25% acad. yr., 50% Sum.) 29,085
Yoav Shoham, Asst. Professor (25% acad. yr., 50% Sum.) 16,665
Vladimir Lifschitz, Sr. Research Assoc. (100%) 60,504
Carolyn Talcott, Research Assoc. (25%) 12,000
N. Shankar, Research Assoc. (100%) 45,996
Gian-Luigi Bellin, Stud. Res. Ast. (50% acad. yr., 100% Sum.) 14,325
Robert Givan, Stud. Res. Ast. (50% acad. yr., 100% Sum.) 14,325
Rutie Adler, Secretary (30%) 7,175
---------
Annual salary subtotal 200,075
Annual budget begin dates 4/1/87- 4/1/88-
End dates 3/31/88 3/31/89
Annual salary subtotal 200,075 200,075
Allowance for salary increases 7,003 19,007
(6% beginning 9/1/87,
12% beginning 9/1/88,
--------- ---------
Salary total by year 207,078 219,082
Staff benefits (24.7% till 9/1/87, 52,719 57,856
26.0% till 9/1/88, 26.7% thereafter)
Travel (4 East Coast trips/year 8,000 8,000
@ $1000, 8 Western trips/yr.
@ $500)
Computer time costs 60,000 63,000
Other direct costs (publications, 18,000 18,000
supplies, telephones and
other services)
--------- ---------
Subtotal 345,797 365,938
Indirect Costs (73%) 252,432 267,135
--------- ---------
Total by year 598,229 633,073
--------- ---------
Cumulative totals 598,229 1,231,302
∂17-Jan-87 2119 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
FORMAL THEORIES OF ACTION
Vladimir Lifschitz
Thursday, January 22, 4pm
Bldg. 160, Room 161K
We apply circumscription to formalizing reasoning about the effects
of actions in the framework of situation calculus. An axiomatic description
of causal connections between actions and changes allows us to solve the
qualification problem and the frame problem using only simple forms of
circumscription.
In this talk the method is illustrated by constructing a
circumscriptive theory of the blocks world in which blocks can be moved
and painted. We show that the theory allows us to compute the result of
the execution of any sequential plan.
∂18-Jan-87 1145 JMC
vtss
∂18-Jan-87 2012 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU [Diana Wood <WOOD@SUMEX-AIM.STANFORD.EDU>: Siglunch: January 23]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Jan 87 20:12:45 PST
Date: Sun 18 Jan 87 20:10:46-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: [Diana Wood <WOOD@SUMEX-AIM.STANFORD.EDU>: Siglunch: January 23]
To: jmc@SAIL.STANFORD.EDU, nilsson@SCORE.STANFORD.EDU
Message-ID: <12272054867.17.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
I THOUGHT YOU MIGHT BE INTERESTED IN THIS......ED
---------------
Mail-From: WOOD created at 16-Jan-87 16:35:34
Date: Fri 16 Jan 87 16:35:32-PST
From: Diana Wood <WOOD@SUMEX-AIM.STANFORD.EDU>
Subject: Siglunch: January 23
To: siglunch@SUMEX-AIM.STANFORD.EDU
Message-ID: <12271491398.86.WOOD@SUMEX-AIM.STANFORD.EDU>
Siglunch
Title: Knowledge Engineering Implications of the Correspondence Between
Decision Theory and Non-Monotonic Reasoning
Time: Friday, January 23, 12:05-1:05 p.m.
Place: Chemistry Gazebo
Speaker: Curt Langlotz
From: Medical Information Sciences, Stanford University
Abstract:
Classical decision theory cannot be used in isolation to provide
expert consultation. It does, however, provide practical insights
that impact the knowledge engineering process. Previously, I have
presented a decision-theoretic analysis of situation-action heuristics
that helps answer several questions consequential to system-builders.
This approach has been extended by considering situation-action
problem solving as a special case of non-monotonic reasoning. By
establishing a simple logical correspondence between decision theory
and non-monotonic logic, it can be shown that non-monotonic inference
is a compilation of two decision-theoretic concepts: likelihoods and
utilities. An intuitive study of these two notions demonstrates that
likelihood knowledge has several problem-independent characteristics,
whereas utility information is problem-specific.
This talk will present and discuss examples of the following practical
lessons from this decision-theoretic view of non-monotonic reasoning:
(1) Non-monotonic logic does not retain the same domain-independent
characteristics of classical (monotonic) logic. This conclusion may
undermine one frequent justification for the use of non-monotonic
logic to implement planning systems. (2) Because certain knowledge
representations (e.g. situation-action rules, non-monotonic logic)
inherently contain problem-specific components, they may be
inappropriate to employ in the construction of "very large"
problem-independent knowledge bases. (3) Many problems require an
explicit separation of likelihood knowledge and utility information.
Through judicious combinations of artificial intelligence techniques
and decision theory, system-building methodologies can be developed to
facilitate solutions for this class of problems.
-------
-------
∂18-Jan-87 2140 CLT
∂18-Jan-87 2043 JMC
Please retrieve my Boise output, CAL[1,jmc](4) and PHON[1,JMC].
done, i assume you want it brought home
∂18-Jan-87 2334 ZABIH@Sushi.Stanford.EDU SCHEMER Talk
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Jan 87 23:34:45 PST
Date: Sun, 18 Jan 1987 23:31 PST
Message-ID: <ZABIH.12272091340.BABYL@SUSHI.STANFORD.EDU>
From: ZABIH@Sushi.Stanford.EDU
To: clt@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU, daniel@Mojave.Stanford.EDU,
lamping@Sushi.Stanford.EDU
Cc: zabih@Sushi.Stanford.EDU
Subject: SCHEMER Talk
I'm going to give an informal talk this Friday about my Master's
Thesis. I have reserved MJH 252 from 3:00 to 4:30 for my talk. I'm
willing to hand out copies of my thesis to anyone really interested,
but it would be better to wait for the forthcoming Technical Report
(since there are some inaccuracies in the thesis).
Ramin
ABSTRACT:
Many problems in Artificial Intelligence involve generate-and-test
search. Lisp-like languages with non-determinism provide a natural
way of expressing these problems, while dependency-directed
backtracking is a good way to solve them. Putting the two together
should result in a powerful tool for generate-and-test search
problems. This thesis presents a non-deterministic Lisp dialect
called SCHEMER, and implements dependency-directed backtracking for
SCHEMER programs.
∂19-Jan-87 0035 edsel!bhopal!jonl@navajo.stanford.edu "Diversion" proposal
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Jan 87 00:35:33 PST
Received: by navajo.stanford.edu; Mon, 19 Jan 87 00:34:33 PST
Received: from bhopal.edsel.com by edsel.uucp (2.2/SMI-2.0)
id AA02962; Mon, 19 Jan 87 00:22:38 pst
Received: by bhopal.edsel.com (3.2/SMI-3.2)
id AA02356; Mon, 19 Jan 87 00:22:19 PST
Date: Mon, 19 Jan 87 00:22:19 PST
From: edsel!bhopal!jonl@navajo.stanford.edu (Jon L White)
Message-Id: <8701190822.AA02356@bhopal.edsel.com>
To: navajo!jmc%su-ai@navajo.stanford.edu
Cc: bhopal!qlisp@navajo.stanford.edu, bhopal!jonl@navajo.stanford.edu
Subject: "Diversion" proposal
I'm not sure how we were supposed to transmit to you the proposal for
the "diversion" about message-passing Lisp, but I'll send you a copy
of the plain ascii text in the following message. It resides here
at lucid on /u/jonl/qlisp/msg-prop.txt, and a "hand formatted" hardcopy
is on RPG's chair and on my desk.
Our world was down Saturday, so it didn't get done until Sunday evening.
-- JonL --
∂19-Jan-87 0035 edsel!bhopal!jonl@navajo.stanford.edu Text of the "Diversion" proposal
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Jan 87 00:35:39 PST
Received: by navajo.stanford.edu; Mon, 19 Jan 87 00:34:43 PST
Received: from bhopal.edsel.com by edsel.uucp (2.2/SMI-2.0)
id AA02969; Mon, 19 Jan 87 00:23:27 pst
Received: by bhopal.edsel.com (3.2/SMI-3.2)
id AA02362; Mon, 19 Jan 87 00:23:10 PST
Date: Mon, 19 Jan 87 00:23:10 PST
From: edsel!bhopal!jonl@navajo.stanford.edu (Jon L White)
Message-Id: <8701190823.AA02362@bhopal.edsel.com>
To: navajo!jmc%su-ai@navajo.stanford.edu
Subject: Text of the "Diversion" proposal
Distributed Multi-processing for Qlisp
INTRODUCTION
We propose to implement a message-passing based distributed Lisp
environment as a preliminary step towards the full multi-processor
implementation of a multi-processing Qlisp. There will be a 'master'
processor, which will send tasks to 'slave' processors, and then
coordinate their return values. Communication between the processors
will only be via this message-sending and receiving mechanism, and main
memory will not be "shared" amongst them. In effect, a process will be
assigned to exactly one processor, which must complete it and send a
result or a failure code back to its caller. This differs from the
Qlisp model in that that a process in Qlisp may migrate to any available
processor, and in that it will be implemented using the Common Lisp
semantics of CATCH rather than the Qlisp semantics.
MESSAGE FORMATS
Initially, "Messages" will be encoded as ascii strings to be read in
by the standard Lisp READ function, and evaluated. The communication
channel will be a pipe of whatever sort we can efficiently implement
on our machine (it could be an ethernet link too, but for the Alliant,
we expect to use some small number of shared pages for a much faster
pipe between the several processors).
We may consider developing a more specific Remote Procedure Protocol.
That is, instead of merely sending the text for forms to be evaluated,
we will devise a "record structure" which can be more quickly encoded
and decoded on either side. We have had some experience with the
Courier RPC formats in standard use by the Xerox Network Systems
protocols, and with the research prototype called "Cedar RPC" (also
developed by Xerox Palo Alto Research Center).
THE PROCESSORS -- Master and Slave
Each processor will be running an experimental multi-processing
version of Lucid Common Lisp. Although Lucid's product does not
yet have multi-processing capability, a primitive implementation
of so-called "stack groups" has been tested in-house for some
time now, and can provide the rudiments of a Lisp-based multi-
processing environment (note: "multi-processing", not "multi-
processor"). It currently does pre-emptive time-slicing (albeit
with a "dumb" scheduler algorithm, but we are not at this time
overly concerned with time-sharing efficiency), and provides
the capability for user-written code to be attached to certain
interrupt conditions.
We will need a multi-processing capability in order to implement
the main tasks and the communication-channel tasks all in Lisp.
Furthermore,
(1) When the master is interpreting a QLET, it will perhaps
apportion out jobs to several slaves to evaluate some
"arguments", subject to the restriction that the slave has
only a local environment and can only communicate with the
master via the "message-passing" channel. At least one
process will be required for the Lisp part of the
communication channel (and ideally, each communication would
spawn a separate process, which would be reclaimed when that
particular task request is completed); and at least one other
process will be necessary for the limited Qlisp interpreter.
(2) When a slave is running one task, it may receive yet another
service request. This will happen because the 'master' will
have no exact idea of just how many processors there are, so
will have to apportion out its workload based on something
other than the "one worker, one job" rule. But even if the
master were to know exactly how many processors are available,
there will always be situations in which processes will be spawned
faster than they can be completed, and the "backlog" will be have
to be apportioned out among the 'slaves'. In a real Qlisp, however,
the "backlog" would merely be appended to a central queue. Of
course, a slave also needs at least one dedicated task for the
communication channel service; we would expect also to have a
"dispatcher" task whose job is to take service requests off a
pending queue, and actually initiate the Lisp-based process which
will perform the service request.
We forsee no immediate problem in being able to run at least a few tens
of processes in each one the Lucid Common Lisp images; this should be
enough to support some reasonable programming experiments.
PROTOCOLS
Each task request will carry a unique identification tag, so that
communication for several tasks may be multiplexed over the one
communication channel between 'master' and 'slave' [in one sense,
this is merely a cheap way of setting up unique communication channels].
The id tag will be generated by the 'slave' when it accepts a task from
the 'master', and the immediate communication back to the 'master' of
the task id will be confirmation of the assignment. These tags will not
only serve a normal communications purpose, but will also aid in
monitoring and debugging the whole design.
We intend the communications to be performed as low-overhead, interrupt
driven protocols. While a 'slave' is multi-processing among its current
tasks, interrupt level operations will append new requests to a queue
of current "services", and they may even insert process-deletion requests
into it which will cause the abnormal termination of some already
running task. We also intend the "transmittal" and "receipt" of these
messages to be low-overhead in the amount of processing required;
for example, "receipt" will be little more than
(1) READing the input text, and parsing it into a trivial RPC
format that admits at most a few operations.
(2) assuming that the RPC request is for a new task assignment,
then generate a new task request with a unique id and post it
into the queue of all service requests; its initial [runnable]
state is merely a form to be evaluated, which is constructed
from the input text.
(3) send back to the caller [the 'master'?] confirmation of the
action requested.
These are all bounded, and relatively short, operations; we will
view them as the atomic steps of our communication protocol. This
way, there will be no critical sections in the communications, and
we will not need to address problems arising out of any additional
asynchrony caused by communication delays. In the real Qlisp model,
communication is "instantaneous" because of having a single address
space for all the processors, and because of the hardware interlocks
in a properly-shared memory bus [such as bus arbiters at the electrical
level, and "test-and-set", or "compare-and-swap" instructions at the
software level].
Normal completion of a task will also include sending the results back
to the 'master'; the unique id tag serves to dispatch the result to
the right "place" in the 'master'. Note however that killing a running
process will not be a time-bounded request, since it will typically
involve running the "clean-up" forms of unwind-protect clauses in the
task being killed. We are not currently contemplating "return values"
or "arguments" which are themselves of extremely large or unbounded size
[in which case there would need to be the capability for out-of-band
transmission, somewhat akin to the data-stream used for for a FTP
file transfer that is initiated by an "in-band" TELNET connection].
The RPC request types we anticipate are:
(1) New service request -- item (2) above;
(2) Status request, for a previously-established service request;
(3) Abnormal termination of a previously-established service request;
(4) Overall Status request -- such as reporting on the total number of
outstanding service requests;
If some of the embellishments described below are taken, then we may
also want:
(5) Re-order the queue, based on chaning priorities of the outstanding
service requests.
POTENTIAL EMBELLISHMENTS
We may find ourselves in the position of wanting to drop the
master/slave distinction, and expand the experiment with all
processors on equal footing. There would then arise simple questions
like "credentials" -- which processor or process is allowed to
requisition which resources (such as other processors, or more and
more spawned processes). The more complex questions would that would
arise have to do with "load balancing", and with the avoidance of
"mindless parallelism" wherein all available resources are consumed by
a breadth-first expansion of processes before some essential computation
is permitted to run (but which would have been run had the parallelism
been expanded depth-first). We explicitly do not want to investigate
load-balancing or resource-scheduling in general now; but we do
anticipate to need to look at the mechanisms required to support
CATCH in Qlisp, where a minimal amount of "process introspection"
seems to be necessary.
CODICIL
Possibly we may use this model to stage experiments in programming
in Qlisp. We need to know more about how particular programming
styles will be affected by the Qlisp parallelism; or put another way,
we want to know how to write programs which effectively utilize the
features of Qlisp. Among the kinds of questions for which we seek
pragmatic data as an aid to understanding are (1) what are the
bottle necks? are there too many processes active at some point in
time? (2) what is the degree of parallelism? will the QLET construct
be adequate for expressing the need to keep many processors busy?
what kinds of programs will be forced into an inherently serial mode?
(3) what problems will we encounter when trying to "kill" all the
processes spawened "underneath" a Qlisp CATCH or QCATCH? will we have
a "garbage-collection of processes" problem?
∂19-Jan-87 1153 SIMPSON@A.ISI.EDU Re: arrival time?
Received: from A.ISI.EDU by SAIL.STANFORD.EDU with TCP; 19 Jan 87 11:53:15 PST
Date: 19 Jan 1987 14:52-EST
Sender: SIMPSON@A.ISI.EDU
Subject: Re: arrival time?
From: SIMPSON@A.ISI.EDU
To: JMC@SAIL.STANFORD.EDU
Message-ID: <[A.ISI.EDU]19-Jan-87 14:52:59.SIMPSON>
In-Reply-To: The message of 18 Jan 87 2241 PST from John McCarthy <JMC@SAIL.STANFORD.EDU>
John: I won't be able to see you until 0930, but Bill Scherlis
may be able to receive you at 0900. Have a safe trip. -- Bob
∂19-Jan-87 1238 C.CHATT@HAMLET.STANFORD.EDU FJALKDGH
Received: from HAMLET.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Jan 87 12:38:30 PST
Date: Mon 19 Jan 87 12:35:28-PST
From: rob greenberg <C.CHATT@HAMLET.STANFORD.EDU>
Subject: FJALKDGH
To: J.JMC@HAMLET.STANFORD.EDU
Message-ID: <12272234126.206.C.CHATT@HAMLET.STANFORD.EDU>
HEY BOY, I'M GONNA' KICK YOUR ASS!!!!! YOU'D BETTER WATCH OUT WHEN YOU
LEAVE THIS PLACE, CAUSE I'M GONNA' BE WAITIN' FOR YA'
FROM THE SLASHER
-------
∂19-Jan-87 1333 GOLUB@Score.Stanford.EDU Re: Piggott Professorship party
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Jan 87 13:33:42 PST
Date: Mon 19 Jan 87 13:21:21-PST
From: Gene H. Golub <GOLUB@Score.Stanford.EDU>
Subject: Re: Piggott Professorship party
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 11 Jan 87 16:03:00-PST
Phone: 415/723-3124
Message-ID: <12272242480.10.GOLUB@Score.Stanford.EDU>
I'd be pleased to come. When is it? ( Or has it happened?)
Gene
-------
∂20-Jan-87 1029 CLT wics ke banquet talk
They currently are using the title ``Common Sense''.
If this is not the title you would like on the brochure
you should call Joleen by Friday or after that call
Sharon (408-462-0811)
∂20-Jan-87 1252 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU Draft for Comments
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Jan 87 12:52:32 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Tue 20 Jan 87 12:48:57-PST
Date: Tue 20 Jan 87 12:50:32-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: Draft for Comments
To: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SCORE.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SCORE.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: Gsmith@SUMEX-AIM.STANFORD.EDU
Message-ID: <12272499013.21.GSMITH@SUMEX-AIM.STANFORD.EDU>
Attached is a DRAFT of the AI Qual announcement for comments.
Pls let me know this week if you have suggested changes so
I can send it to the Qual preparation class.
AI QUAL 1986-87
B.G. Buchanan (1/20/87)
The purpose of the AI Qual is to determine whether a student has sufficient
breadth of knowledge in AI and depth of knowledge in one or more subtopics of
AI to be admitted to candidacy in the PhD program.
The syallabus for the AI Qual for the 1986-87 academic year is the "General
Reading List for Artificial Intelligence" by Subramanian and Buchanan
(STAN-CS-86-1093 or KSL-85-54). Students should be familiar with basic
concepts and techniques in all of the areas listed and should know where to
find additional information. In addition, students should be familiar in depth
with two of the specialized topics in the syllabus. It is expected, but not
necessary, that the area in which a student expects to do dissertation research
will be included in the two.
The format of the examination will be a 90 minute oral exam. Approximately one
hour will be spent on the breadth examination and 30 minutes on detailed
examination within the specialized topics.
At the time of sign-ups for the exam, students will be asked to list the two
specialized sub-topics on which they wish to be examined in more depth. This
will allow selection of appropriate members of the examining committee.
The date of the examination has not been set, but will most probably be in May
or early June.
⊗
-------
∂20-Jan-87 1313 yvo@sally.utexas.edu Visiting Appointment and Woody Bledsoe
Received: from SALLY.UTEXAS.EDU by SAIL.STANFORD.EDU with TCP; 20 Jan 87 13:12:58 PST
Date: Tue, 20 Jan 87 15:11:54 CST
From: yvo@sally.utexas.edu (Yvonne Van Olphen)
Posted-Date: Tue, 20 Jan 87 15:11:54 CST
Message-Id: <8701202111.AA28748@sally.utexas.edu>
Received: by sally.utexas.edu (5.54/5.51)
id AA28748; Tue, 20 Jan 87 15:11:54 CST
To: jmc@sail.stanford.edu, clt@sail.stanford.edu
Subject: Visiting Appointment and Woody Bledsoe
Cc: ics.browne@r20.utexas.edu
MEMORANDUM
Date: January 20, 1987
To: John McCarthy, Carolyn Talcott
From: J. C. Browne
Subject: Visiting Appointment at Austin in 87-88 and Letter
of Support for Bledsoe Nomination
There are two purposes to this message. One is to reopen
the possibilities we discussed in the past about the two of
you spending the 1987-88 academic year as visitors in Aus-
tin. Bobby Inman's chair in Computer Theory, which Tony
Hoare is occupying this year, will be open. We'd be
delighted to have John McCarthy as the visitor for this
chair in 87-88. We would also be equally delighted to have
Carolyn Talcott on the faculty for 87-88.
We are also nominating Woody Bledsoe for the O'Donnell Chair
starting in 87-88. We would like very much to have a letter
of support for Woody for the allocation of this endowed
position if you can do so. Please call me at (512) 471-9584
if you want further information.
JCB/yvo
∂20-Jan-87 1356 RA telex from Imperial College
This is a telex you just got:
Prof. E.A. Ash Rector Imperial College, London would be grateful for reply
to request for reference for Dr. K.L. Clark candidate for promotion to
Professor at Imperial. Promotion interview started threfore reference important.
Contact R. Letham, Senior Presonnel Officer, Imperial College, London,
SW7 2AZ UK. Tel +44-1-5895111, ext. 3303.
----End of telex----
∂20-Jan-87 1438 JJW Comments on message-passing proposal
To: RPG
CC: JMC, CLT
General comments:
1. It isn't clear how the language is going to differ from Qlisp, i.e.
what features if any are removed or have different interpretations.
2. Does process creation only happen at top level, with the master
creating the slaves? What if one of the slaves wants several things
done in parallel?
3. A simple example program might clarify things.
INTRODUCTION:
4. The second half of the last sentence confuses me. What is the Common
Lisp semantics of CATCH in a multiprocessing environment? Is the idea
that the THROW must be in the same processor as the CATCH, else it is
treated like an uncaught THROW?
MESSAGE FORMATS:
5. Common Lisp streams seem to be a natural way to pass message text.
This could be implemented either by shared memory or I/O between
separate processors.
THE PROCESSORS:
6. The distinction between "multiprocessing" and "multiprocessor" is
usually called "multiprogramming" vs. "multiprocessing", I believe.
PROTOCOLS:
7. Typo in item (5) at end of section: "chaning" => "changing"?
∂20-Jan-87 1639 M.MRIZEK@LEAR.STANFORD.EDU LOTS 10th Birthday Celebration
Received: from LEAR.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Jan 87 16:39:43 PST
Date: Tue 20 Jan 87 16:36:33-PST
From: Lori Mrizek <M.MRIZEK@LEAR.STANFORD.EDU>
Subject: LOTS 10th Birthday Celebration
To: jmc@SU-AI.ARPA
cc: m.mrizek@LEAR.STANFORD.EDU, g.gorin@LEAR.STANFORD.EDU
Message-ID: <12272540158.106.M.MRIZEK@LEAR.STANFORD.EDU>
Professor McCarthy,
We have not yet received your RSVP for the LOTS party this Friday, the
23rd. (3-5 p.m., 2nd Floor, Sweet Hall.) We wanted to find out if you
would be able to attend or not. If you can attend, Ralph would like
to invite you to say a few words on the beginning days of LOTS. It
does not have to be anything formal, but just something brief and
appropriate.
Please let us know as soon as possible. Thank you very much.
Lori Mrizek
-------
∂21-Jan-87 1308 RA Orlov's visit
Prof. Herman Winick from SLAC called re Orlov's visit, Mon. Jan. 26. Orlov
has a very tight schedule and Winick was wondering whether it would be ok
with you to have the lunch at the faculty club end at 1:20 at which time
Winick will come to the faculty club to pick Orlov up and take him to
wherever he is supposed to go next. Winick thought that there is also
a possibility that both he and Kheifets will join the lunch if it's ok with
you. He would like you to give him a call at SLAC--854 3300, ext. 3155.
∂21-Jan-87 1313 RICHARDSON@Score.Stanford.EDU Binford
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 13:13:29 PST
Date: Wed 21 Jan 87 13:09:49-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Binford
To: jmc@Sail.Stanford.EDU
cc: ra@Sail.Stanford.EDU
Message-ID: <12272764667.23.RICHARDSON@Score.Stanford.EDU>
Can you please let me know what the status is on the Binford reappointment?
Thanks,
Anne
-------
∂21-Jan-87 1341 TAJNAI@Score.Stanford.EDU Hertz Fellowship
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 13:41:35 PST
Date: Wed 21 Jan 87 13:37:52-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Hertz Fellowship
To: jjw@Sail.Stanford.EDU
cc: BScott@Score.Stanford.EDU, Bergman@Score.Stanford.EDU,
JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU, cheadle@Score.Stanford.EDU
Message-ID: <12272769772.25.TAJNAI@Score.Stanford.EDU>
Joe, Kathryn Smith is writing a letter to you today. Your Hertz
Fellowship will be reinstated for Winter and Spring 1986/87.
You are eligible for 1987/88 also, and we recommend that you apply
for renewal.
Carolyn
-------
∂21-Jan-87 1405 MAYR@score.stanford.edu Richard Cole visiting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 14:05:01 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 21 Jan 87 14:03:31 PST
Date: Wed 21 Jan 87 14:00:41-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Richard Cole visiting
To: fndsch@navajo.stanford.edu
Message-Id: <12272773928.18.MAYR@Score.Stanford.EDU>
Richard Cole from NYU is going to be the first visiting candidate for our
fndsch. He'll be here Monday, Feb. 9. Below is the skeleton of his
schedule. I urge you to grab whatever time slot is convenient for you to
talk with Richard. Also, you may want to choose a half hour or one hour slot,
and let me know whether you'd like to join lunch at the FC and/or dinner.
I also enclose title and abstract of his presentation:
Who: Prof. Richard Cole, NYU
What: "Parallel Merge Sort"
When: Monday, Feb. 9, at 10:00am (!!)
Where: TBA
Why: It's a wonderful talk, and he is applying here for a faculty position.
Abstract:
We give a parallel implementation of merge sort on a CREW PRAM that uses n
processors and O(log n) time; the constant in the running time is small. We
also give a more complex version of the algorithm for the EREW PRAM; it also
uses n processors and O(log n) time. The constant in the running time is still
moderate, though not as small.
Schedule:
10:00-11:00 talk
11:00-11:30
11:30-12:00
12:00- 1:30 lunch at FC
1:30- 2:00 Mayr
2:00- 2:30 Nilsson
2:30- 3:00
3:00- 3:30
3:30- 4:00
4:00- 4:30
4:30- 5:00
6:00- ... dinner
-------
∂21-Jan-87 1412 MAYR@score.stanford.edu Joel Friedman visiting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 14:12:30 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 21 Jan 87 14:11:20 PST
Date: Wed 21 Jan 87 14:08:29-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Joel Friedman visiting
To: fndsch@navajo.stanford.edu
Message-Id: <12272775348.18.MAYR@Score.Stanford.EDU>
And then there is Joel Friedman, UC Berkeley, visiting Stanford (this side
of the Bay) on Thursday, Feb. 19. He is also applying for a position.
He'll be talking about zones of convergence for Newton's method (most
likely; exact title and abstract will follow as soon as available).
There is another partially filled schedule below. Please fill in the
blanks whereever convenient for you!
Schedule for Joel Friedman:
10:00-10:30 Mayr
10:30-11:00
11:00-11:30
11:30-12:30 lunch (fast food)
12:30- 1:30 talk (AFLB)
1:30- 2:00
2:00- 2:30 Nilsson
2:30- 3:00
3:00- 3:30
3:30- 4:00
4:00- 4:30
4:30- 5:00
Please return to mayr@score with fewer blanks! Thanks,
-ernst
-------
∂21-Jan-87 1436 JJW Re: Hertz Fellowship
To: TAJNAI@SCORE.STANFORD.EDU
CC: JMC@SAIL.STANFORD.EDU, LES@SAIL.STANFORD.EDU
Thanks for letting me know about the Hertz Fellowship. That's good
news! About 1987-88, I really don't intend to be here that long, but
if you think it would be best for me to apply for renewal (i.e., that
it won't hurt the chances of people in this department applying for
new fellowships), then I'll do so.
∂21-Jan-87 1442 busalacc@umn-cs
Received: from UMN-CS.ARPA by SAIL.STANFORD.EDU with TCP; 21 Jan 87 14:40:10 PST
Received: by umn-cs.UMN (5.51/4.7)
id AA18527; Wed, 21 Jan 87 16:40:21 CST
Date: Wed, 21 Jan 87 16:40:21 CST
From: busalacc@umn-cs (Perry J. Busalacchi)
Message-Id: <8701212240.AA18527@umn-cs.UMN>
To: busalacc@umn-cs, jmc@sail.stanford.edu
Dr. McCarthy,
I am a Ph.D. student at the University of Minnesota working for Dr. James
Slagle. Dr. Slagle suggested I contact you regarding my research in the area
of parallel computation applied to artificial intelligence research and
expert system development. We intend to port a parallel lisp to the 64 node
NCUBE we currently have at the university. We would enjoy the opportunity to
port one of your lisps. How can we make this happen?
Any suggestions would be greatly appreciated. I look forward to hearing
from you.
Sincerely,
Perry J. Busalacchi
612-641-0872
∂21-Jan-87 1505 ullman@navajo.stanford.edu Area X QUAL
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 15:05:12 PST
Received: by navajo.stanford.edu; Wed, 21 Jan 87 15:04:12 PST
Date: Wed, 21 Jan 87 15:04:12 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Area X QUAL
To: genesereth@score.stanford.edu, jmc@sail.stanford.edu,
nilsson@score.stanford.edu, papa@score.stanford.edu,
wiederhold@SUMEX-AIM.Stanford.EDU
I have a student, Yatin Saraiya, who would like to take a qualifying
exam in "Area X". The subject matter, as outlined by Marianne Winslett
last year, would include algorithm analysis, database systems,
and parts of the AI curriculum, principally matters concerned with
logic. In terms of courses, the subject matter would include:
223, 245, 323, 326, 345, 347, and perhaps 356 (Halpern's course),
plus Math 160A and/or CS 257AB.
Would two or more of you be willing to join with me to set a
reading list and administer the first exam, probably in Oct.?
---jdu
∂21-Jan-87 1505 RICHARDSON@Score.Stanford.EDU Annual Faculty Report
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 15:05:31 PST
Date: Wed 21 Jan 87 15:01:59-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Annual Faculty Report
To: jmc@Sail.Stanford.EDU
Message-ID: <12272785086.23.RICHARDSON@Score.Stanford.EDU>
The Dean's office has sent me a memo making a third request for Annual
Faculty Reports. May I ask that you send that to me so that I may forward
it?
Thanks,
Anne
-------
∂21-Jan-87 1536 TAJNAI@Score.Stanford.EDU Re: Hertz Fellowship
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 15:32:34 PST
Date: Wed 21 Jan 87 15:26:45-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Re: Hertz Fellowship
To: JJW@Sail.Stanford.EDU
cc: JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU
In-Reply-To: Message from "Joe Weening <JJW@SAIL.STANFORD.EDU>" of Wed 21 Jan 87 14:36:00-PST
Message-ID: <12272789594.25.TAJNAI@Score.Stanford.EDU>
It doesn't seem that the decision was based on how many students
at Stanford CSD have Hertz Fellowships, as to which ones they
select. Otherwise, they wouldn't have had the money to reinstate yours.
They consider the Hertz a 5 year commitment each time a new one is
awarded. I think you should definitely request a renewal.
CArolyn
-------
∂21-Jan-87 1654 WIEDERHOLD@Score.Stanford.EDU industrial visitors
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 16:54:19 PST
Date: Wed 21 Jan 87 16:49:27-PST
From: Gio Wiederhold <WIEDERHOLD@Score.Stanford.EDU>
Subject: industrial visitors
To: jmc@Sail.Stanford.EDU
Message-ID: <12272804651.40.WIEDERHOLD@Score.Stanford.EDU>
Should I do anything about John Sowa as industrial lecturer this fall
or is everything ok?
Gio
-------
∂21-Jan-87 1748 ZABIH@Sushi.Stanford.EDU SCHEMER Talk
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 17:47:32 PST
Date: Wed, 21 Jan 1987 17:43 PST
Message-ID: <ZABIH.12272814537.BABYL@SUSHI.STANFORD.EDU>
From: ZABIH@Sushi.Stanford.EDU
To: John McCarthy <JMC@Sail.Stanford.EDU>
Subject: SCHEMER Talk
In-reply-to: Msg of 19 Jan 1987 00:32-PST from John McCarthy <JMC at SAIL.STANFORD.EDU>
If you want to know the details of what I did, I can either explain
the research to you (which would probably take about 45 minutes) or I
can give you a copy of the Technical Report when I get it written. I
don't expect to write the TR until the end of March, though.
Ramin
∂21-Jan-87 1754 NILSSON@Score.Stanford.EDU your cv
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 17:52:26 PST
Date: Wed 21 Jan 87 17:47:37-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: your cv
To: binford@Whitney.Stanford.EDU
cc: nilsson@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12272815240.12.NILSSON@Score.Stanford.EDU>
Tom, we can't even start your reappointment process without your
cv (which Rutie, John's secy, needs to send out with requests
for evaluation letters). I guess I've been thinking of this problem
as being eventually "self-correcting," because I thought you would
realize that without a reappointment process, there can't be
a reappointment. There are various deadlines---now fast approaching---
that we must meet in order to reappoint you in the Fall. -Nils
-------
∂21-Jan-87 1841 ROBERTS@Sushi.Stanford.EDU re: SERC probation report!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Jan 87 18:41:02 PST
Date: Wed 21 Jan 87 18:37:19-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: re: SERC probation report!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 8 Jan 87 17:38:00-PST
Message-ID: <12272824286.29.ROBERTS@Sushi.Stanford.EDU>
Did you check on this John - i'd hate to find myself disinterited by SERC!
paul
-------
∂21-Jan-87 2134 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
FORMAL THEORIES OF ACTION
Vladimir Lifschitz
Thursday, January 22, 4pm
Bldg. 160, Room 161K
We apply circumscription to formalizing reasoning about the effects
of actions in the framework of situation calculus. An axiomatic description
of causal connections between actions and changes allows us to solve the
qualification problem and the frame problem using only simple forms of
circumscription.
In this talk the method is illustrated by constructing a
circumscriptive theory of the blocks world in which blocks can be moved
and painted. We show that the theory allows us to compute the result of
the execution of any sequential plan.
∂22-Jan-87 0042 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Jan 23, 11:00
Place: 252 Margaret Jacks
Topic: Qlisp programming and semantics
∂22-Jan-87 0647 GOLUB@Score.Stanford.EDU re: Piggott Professorship party
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Jan 87 06:46:10 PST
Date: Thu 22 Jan 87 06:42:39-PST
From: Gene H. Golub <GOLUB@Score.Stanford.EDU>
Subject: re: Piggott Professorship party
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 21 Jan 87 21:20:00-PST
Phone: 415/723-3124
Message-ID: <12272956329.12.GOLUB@Score.Stanford.EDU>
Thanks for remembering me. I'm relly pleased by your getting a chair --
you deserve this recognition and much more.
Gene
-------
∂22-Jan-87 0736 RICHARDSON@Score.Stanford.EDU re: Binford
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Jan 87 07:36:45 PST
Date: Thu 22 Jan 87 07:33:14-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: re: Binford
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 21 Jan 87 21:26:00-PST
Message-ID: <12272965539.17.RICHARDSON@Score.Stanford.EDU>
Thanks for the info. Perhaps he will respond to Nils' message.
-Anne
-------
∂22-Jan-87 0800 JMC
take it back
∂22-Jan-87 0900 JMC
psa 493-3111 586 0499 ask about whether credit is automatic
∂22-Jan-87 0941 PHY
To: "@SEARCH.DIS[1,PHY]"@SAIL.STANFORD.EDU
To: Search Committee Members
From: Leo Guibas
Don't forget the [short] meeting this afternoon at 1:45 in room 352.
∂22-Jan-87 1051 RA NSF
I tried to call NSF. Bell is not in his office he will probably not be there
this afternoon. I left a msg. that you called. I was told that they
have a big snow storm and the office is closed and might be closed tomorrow too.
Curtis and Chien did not answer their telephone and nobody else picked it up.
∂22-Jan-87 1059 RA be back
I am going to Wordgraphic. Will be back soon.
∂22-Jan-87 1331 RA leaving early
To: JMC, ZM
I need to leave at 3:00 today. Please let me know if there is something
urgent to do before I leave.
Thanks,
∂22-Jan-87 1358 ROBERTS@Sushi.Stanford.EDU Re: Professorship in environmental engineering
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Jan 87 13:58:06 PST
Date: Thu 22 Jan 87 13:54:12-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: Re: Professorship in environmental engineering
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 22 Jan 87 10:38:00-PST
Message-ID: <12273034891.29.ROBERTS@Sushi.Stanford.EDU>
Hey, that's me! (Now, how do I get onto the professorship payscale?)
Philip Larkin does a grand line in gloomy poems, I do a similar one
in typing mistakes. Actually he went to my undergraduate college....
Thanks
Paul
-------
∂22-Jan-87 1456 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: Fighting chance: ten feet to survival.
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Jan 87 14:56:04 PST
Date: Thu 22 Jan 87 14:53:31-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: Re: Fighting chance: ten feet to survival.
To: JMC@SAIL.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 22 Jan 87 11:40:00-PST
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12273045690.82.CRISPIN@SUMEX-AIM.STANFORD.EDU>
Wasn't Petr Beckmann associated with the Fusion Energy Foundation (or
at least endorsed them) for a while?
-------
∂22-Jan-87 1613 CRISPIN@SUMEX-AIM.STANFORD.EDU re: Fighting chance: ten feet to survival.
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Jan 87 16:12:27 PST
Date: Thu 22 Jan 87 16:10:28-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: re: Fighting chance: ten feet to survival.
To: JMC@SAIL.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 22 Jan 87 15:01:00-PST
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12273059696.82.CRISPIN@SUMEX-AIM.STANFORD.EDU>
Okay. I may have been confused. I know that at one time ES was
giving money to the FEF, presumably because he didn't know what
they really were. Actually, what I remember is the topic of the
FEF coming up and my impression that they were on the loonie-tune
fringe even though I didn't know the full details about them at
that time.
Personally, I think that nuclear power is a dead issue in this
country; the pro-nuclear side has thoroughly lost. The protestors
today are pretty stupid; if anything they're keeping the issue alive
instead of letting it die. The market (which ultimately determines
the future of any technology) is decidedly UNinterested in any new
nuclear construction. Nuclear exposure is an issue with power
utilities; PG&E is a good investment not because of their nuclear
exposure, but because of their large customer base and strong
hydroelectric potential. Somewhat less speculative, Central & South-
West is mostly natural gas (they own their supplies) and they have
been profitable even in spite of a hostile Texas PUC (that makes
the California PUC look like pro-utility wimps). They have one
nuclear plant coming online this year; the South Texas Project. It
was your typical disaster, involving many utilities that invested in
it. The lawsuit against the original builders returned a sizeable
settlement. Central used its proceeds to buy out its commitment in
the project; they still own their share but no longer have to put in
any more money into it. So if the STP ever makes money, it is pure
profit for Central; if it dies, then Central breaks even. Central
is perhaps the only utility in the country that has such a luxurious
position with a nuclear plant, and that was only through several
lucky circumstances...
-------
∂22-Jan-87 1823 LES re: reviving Dialnet
[In reply to message rcvd 22-Jan-87 11:23-PT.]
Sorry, I just now got to your message. I agree that the Dialnet idea is
still valid and needs exposure, but given what has happened in recent
years, the most expedient path might be to try to warp UUCPnet (the Unix
telephone network) in the direction of Dialnet. The existing protocols
should work with minor fiddling, so the only change would be to get them
to think in terms of random telephone numbers instead of a rigid relay
network.
Unfortunately, we just missed a good opportunity to push this idea --
the Usenix Conference was this week.
Perhaps we can discuss the DARPA budget either before or after the Qlisp
meeting tomorrow.
∂22-Jan-87 2231 SOWA@IBM.COM Industrial lectureship for fall quarter, 1987
Received: from IBM.COM by SAIL.STANFORD.EDU with TCP; 22 Jan 87 22:31:16 PST
Date: 22 January 1987, 21:13:22 EST
From: Sowa John <SOWA@ibm.com>
To: JMC@SAIL.STANFORD.EDU, WIEDERHOLD@SUMEX-AIM.STANFORD.EDU
Message-Id: <012287.211322.sowa@ibm.com>
Subject: Industrial lectureship for fall quarter, 1987
Following is a proposed course description for the industrial
lectureship series in the fall quarter of 1987. I am sending
my curriculum vitae by U.S. mail.
John Sowa
______________________________________________________________________
Course 309a: Conceptual Structures
John F. Sowa, IBM Systems Research Institute
Description: Problems and issues in knowledge representation and
the semantics of natural languages. Theory of conceptual graphs.
Structure of the lexicon, canonical graphs for English word classes,
logical forms for various features, including quantifiers,
relative clauses, anaphora, tenses, and contexts.
Schemata and their use in word sense determination, metaphor,
and definitions by family resemblances.
Relationships to Montague grammar, situation semantics, game
theoretical semantics, and discourse representation theory.
Conceptual analysis as a basis for knowledge engineering.
Prerequisites: Knowledge of first-order logic and natural language
syntax.
∂23-Jan-87 0129 binford@whitney.stanford.edu your cv
Received: from WHITNEY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Jan 87 01:29:26 PST
Received: by whitney.stanford.edu; Fri, 23 Jan 87 01:32:49 PST
Date: Fri, 23 Jan 87 01:32:49 PST
From: Tom Binford <binford@whitney.stanford.edu>
To: NILSSON@score.stanford.edu, jmc@sail.stanford.edu
In-Reply-To: Nils Nilsson's message of Wed 21 Jan 87 17:47:37-PST
Subject: your cv
Nils
I had it before Christmas but it was left unsent. So
there were some edits. It will be there Monday.
Tom
∂23-Jan-87 1058 RA telephones
Kent Curtis (202) 357-9747
Gordon Bell (202) 357 7936
Susie doesn't answer.
Shall I make the calls for you or do you want to do them yourself.
∂23-Jan-87 1247 guibas@decwrl.dec.com meeting of 1/22, action items
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Jan 87 12:43:12 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Fri, 23 Jan 87 12:42:01 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA20790; Fri, 23 Jan 87 12:43:09 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA13069; Fri, 23 Jan 87 12:43:02 PST
Date: Fri, 23 Jan 87 12:43:02 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8701232043.AA13069@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: meeting of 1/22, action items
Pratt should collect more information on Breazu-Tannen.
Ullman should consider hosting Maley. This needs immediate attention.
Papadimitriou will decide on hosting Mulmuley.
Guibas will collect information on and possibly host Suri.
We will not pursue Schieber at this time.
L.
P.S. I will be out of town 1/25 to 2/10.
∂23-Jan-87 1302 WIEDERHOLD@SUMEX-AIM.STANFORD.EDU Re: Industrial lectureship for fall quarter, 1987
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Jan 87 13:02:45 PST
Date: Fri 23 Jan 87 12:46:14-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.STANFORD.EDU>
Subject: Re: Industrial lectureship for fall quarter, 1987
To: SOWA@IBM.COM
cc: JMC@SAIL.STANFORD.EDU
In-Reply-To: <012287.211322.sowa@ibm.com>
Message-ID: <12273284662.27.WIEDERHOLD@SUMEX-AIM.STANFORD.EDU>
Thanks for your speedy abstract.
Gio
-------
∂23-Jan-87 1415 NILSSON@Score.Stanford.EDU [Jeff Ullman <ullman@navajo.stanford.edu>: UG AI course]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Jan 87 14:15:50 PST
Date: Fri 23 Jan 87 14:00:06-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: [Jeff Ullman <ullman@navajo.stanford.edu>: UG AI course]
To: Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
WINOGRAD@CSLI.Stanford.EDU, JMC@Sail.Stanford.EDU,
Rosenbloom@SUMEX-AIM.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
TOB@Sail.Stanford.EDU, Shortliffe@SUMEX-AIM.Stanford.EDU
Message-ID: <12273298110.25.NILSSON@Score.Stanford.EDU>
We need to talk about Jeff's suggestion. If people have immediate
reactions, we might discuss them via netmail. -Nils
---------------
Return-Path: <ullman@navajo.stanford.edu>
Received: from navajo.stanford.edu by SU-SCORE.ARPA with TCP; Fri 23 Jan 87 11:43:37-PST
Received: by navajo.stanford.edu; Fri, 23 Jan 87 11:46:10 PST
Date: Fri, 23 Jan 87 11:46:10 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: UG AI course
To: nilsson@score.stanford.edu
Cc: genesereth@SUMEX-AIM.Stanford.EDU, ugc@score.stanford.edu
We have discussed the situation regarding instruction in logic
in the UG curriculum, and while the committee has not made any
concrete proposals, I wanted to alert you to the problem
for possible discussion at the "AI retreat".
The basic problem is that the UG program as now constituted
covers logic fairly solidly. They get about 2 weeks in 108A
covering propositional logic, predicate logic definitions,
resolution (in the propositional context), and unification.
They also learn Prolog and write a few programs in that language.
Further, they are required to take a "heavy-duty" logic course,
either M 160A or CS 257AB. Ernst's committee is looking
into substituting a CS course that would cover logic, presumably
from a more computational point of view, e.g., resolution-type
algorithms would be covered in more detail.
With all this training, the undergrads could use a first AI
course that assumes this background and goes on to do other
things, AI models, viewpoints, and paradigms, perhaps models of cognition.
I'm not suggesting that 223 be changed, but that another course,
perhaps even more "advanced" than 223 because it assumed a lot
of what was there, be created expressly for our undergrads and
perhaps others with the background.
Ironically, MS students will often need a course that starts
with fewer prerequisites, because we have more control over
the sequence of courses taken by our own UG's than we do over
the UG preparation of our grad students.
---jeff
-------
∂23-Jan-87 1619 RA leaving
I don't feel well and am leaving now. Have a nice weekend.
∂25-Jan-87 1210 RA [Reply to message recvd: 23 Jan 87 23:30 Pacific Time]
Ialready did.
∂25-Jan-87 2136 @SUMEX-AIM.STANFORD.EDU:Acuff@KSL-EXP-1 re: Pool machine etiquette reminder
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Jan 87 21:36:51 PST
Received: from KSL-EXP-1 by SUMEX-AIM.STANFORD.EDU with TCP; Sun 25 Jan 87 21:34:58-PST
From: Rich Acuff <Acuff@Sumex-AIM.ARPA>
To: John McCarthy <JMC%SAIL.STANFORD.EDU@Sumex-AIM.ARPA>
Subject: re: Pool machine etiquette reminder
Date: 25-Jan-87 21:37:30
Sender: Acuff@KSL-EXP-1
Message-Id: <Acuff.2747626649@KSL-EXP-1>
Please remove jmc-lists@sail from the mailing list ksl-explorer and
other lists concerned with the operation of Lisp machines.
Done.
∂26-Jan-87 0825 RA Binford
I finally got Binford's CV. The letters were signed on Dec. 9. Do you want me
to do them over with today's date, or do you want me to send them as is.
∂26-Jan-87 0830 JMC
Waltuch and Novak
∂26-Jan-87 0923 @Score.Stanford.EDU:GSMITH@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Jan 87 09:23:18 PST
Received: from SUMEX-AIM.STANFORD.EDU by SU-SCORE.ARPA with TCP; Mon 26 Jan 87 09:19:29-PST
Date: Mon 26 Jan 87 09:21:00-PST
From: Grace Smith <GSMITH@SUMEX-AIM.STANFORD.EDU>
Subject: AI Planning Retreat
To: Binford@SCORE.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SCORE.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: Haunga@SCORE.STANFORD.EDU, Puryear@SUMEX-AIM.STANFORD.EDU,
Richardson@SCORE.STANFORD.EDU, Waleson@SUMEX-AIM.STANFORD.EDU,
Gsmith@SUMEX-AIM.STANFORD.EDU
Message-ID: <12274033733.21.GSMITH@SUMEX-AIM.STANFORD.EDU>
I understand that you all agreed at the recent Faculty meeting that
Sunday, March 8 is the day for the AI planning retreat. It will be
at the hostel at Hidden Villa Ranch, 26870 Moody Road in Los Altos
Hills, from 9:30 till 4:30. I'll send maps for those of you who may
never have been there.
Grace
-------
∂26-Jan-87 0930 JMC
Nafeh, nsf
∂26-Jan-87 1000 JMC
Haley
∂26-Jan-87 0959 RA Prof. Denoon
Prof. Denoon is here. He says he is supposed to meet with you at 10:00.
∂26-Jan-87 1156 JUSTESON@Sushi.Stanford.EDU meeting time
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Jan 87 11:56:08 PST
Date: Mon 26 Jan 87 11:51:35-PST
From: John S. Justeson <JUSTESON@Sushi.Stanford.EDU>
Subject: meeting time
To: jmc@Sail.Stanford.EDU
Message-ID: <12274061145.29.JUSTESON@Sushi.Stanford.EDU>
In case you come to wonder this afternoon, I won't be able to come in this
afternoon (I'd been intending to come by sometime early this week to
discuss project topics for CS 326) due to a sleepless night and a
hopefully sleepful afternoon. We didn't have an explicit appointment,
but I wanted to let you know.
-- John
-------
∂26-Jan-87 1219 SJG circ'n question
To: VAL@SAIL.STANFORD.EDU, JMC@SAIL.STANFORD.EDU
CC: de2smith@SUMEX-AIM.STANFORD.EDU
Hi Guys:
Dave and I are confused about the following: is it possible to have
two equivalent theories, say S and T, but such that the result of
circumscribing a predicate in the two theories is different? The
circumscriptions are supposed to be "letting everything else vary",
since that is what Vladimir does in his action formalization.
Our example is the following: set S = <p,q>, and T = <p,p->q>. Now
it looks like q holds after circumscribing p in S, but not after doing
it in q. Doing the circumscription in the closure of S or T seems worse
still (because basically everything ends up being true).
The same problem comes up in my counterfactual stuff, and I was fairly
glad to admit that the construction was taking advantage of ssntactic
information present in the formulation of the database. Now it seems
to me that circ'n has the same property. Is this right?
Thanks.
Matt
∂26-Jan-87 1405 VAL re: circ'n question
To: SJG@SAIL.STANFORD.EDU, JMC@SAIL.STANFORD.EDU
CC: de2smith@SUMEX-AIM.STANFORD.EDU
[In reply to message from SJG rcvd 26-Jan-87 12:19-PT.]
No, the result of circ'n doesn't change if you replace a theory by an equivalent
one. In your example, the result of circumscribing p in S with q varied is
simply S (i.e., circ'n doesn't do anything for you), and the same with T, so we
have
S ≡ T ≡ Circ(S) ≡ Circ(T).
Intuitively, this can be explained as follows. Circ(S) says, in addition to the
axioms of S: "p is false if this is allowed by the axioms of S". But S requires
p to be true, so this additional condition becomes trivial. The same with T.
Circ'n can only make your theory stronger. So if q is provable in T, it will be
provable in Circ(T) as well.
Circ'n can be defined in a purely model-theoretic way, so it doesn't take
advantage of "syntactic information". This can be also seen from its syntactic
definition: Circ(S) is merely a schema with S inserted at a couple of places.
So replacing S by an equivalent formula means simply replacing some of its
subformulas by equivalent expressions.
Vladimir
∂26-Jan-87 1434 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
A QUERY ANSWERING ALGORITHM
FOR CIRCUMSCRIPTIVE AND CLOSED-WORLD THEORIES
Teodor C. Przymusinski
University of Texas at El Paso
<ft00@utep.bitnet>
Thursday, January 29, 4pm
Bldg. 160, Room 161K
McCarthy's theory of circumscription appears to be the most powerful
among various non-monotonic logics designed to handle incomplete and
negative information in knowledge representation systems. In this
presentation we will describe a query answering algorithm for
circumscriptive theories.
The algorithm is based on a modified version of ordered linear resolution
(OL-resolution), which we call a MInimal model Linear Ordered resolution
(MILO-resolution). MILO-resolution constitutes a sound and complete procedure
to determine the existence of minimal models satisfying a given formula.
Our algorithm is the first query evaluation algorithm for general
circumscriptive theories. The Closed-World Assumption (CWA) and its
generalizations, the Generalized Closed-World Assumption (GCWA) and
the Extended Closed-World Assumption (ECWA), can be considered as
special forms of circumscription. Consequently, our algorithm also
applies to answering queries in theories using the Closed-World Assumption
and its generalizations. Similarly, since prioritized circumscription
is equivalent to a conjunction of (parallel) circumscriptions, the
algorithm can be used to answer queries in theories circumscribed by
prioritized circumscription.
∂26-Jan-87 1606 RA [Reply to message recvd: 23 Jan 87 17:20 Pacific Time]
This was the address given in the letter.
∂26-Jan-87 1739 rms@prep.ai.mit.edu GNU EMACS
Received: from PREP.AI.MIT.EDU by SAIL.STANFORD.EDU with TCP; 26 Jan 87 17:39:04 PST
Received: by prep.ai.mit.edu; Mon, 26 Jan 87 18:05:17 EST
Date: Mon, 26 Jan 87 18:05:17 EST
From: rms@prep.ai.mit.edu (Richard M. Stallman)
Message-Id: <8701262305.AA20727@prep.ai.mit.edu>
To: AIR@sail.stanford.edu
Cc: JMC@sail.stanford.edu
In-Reply-To: Arkady Rabinov's message of 03 Dec 86 1435 PST <8612032305.AA00173@prep.ai.mit.edu>
Subject: GNU EMACS
It seems that GNU Emacs 18.36 finally works on RT's.
A week ago people at Athena finally got their compiler problems
straightened out enough to compile Emacs; then I went there
to debug the remaining problems. I felt I owed this as part of
being hired to consult for your project. Today 18.36 was checked
out at Athena and it works, although there was one crash that
did not repeat when the same commands were typed. Probably there
will be bugs fixed in 18.37 or 18.38, but you can start using it now.
But that is assuming the version of the C compiler you have works well
enough to produce valid output for valid input. Various versions are
in distribution and you might have one of the worse ones. I can't
help you there, now. There's some chance I will do an RT port for the
GNU C compiler next month. If that happens, C compiler bugs on the RT
won't be so hard to fix.
∂26-Jan-87 1834 tah@linz.stanford.edu Macsyma-manual
Received: from LINZ.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Jan 87 18:33:58 PST
Received: by linz.stanford.edu (3.2/SMI-3.2)
id AA02882; Mon, 26 Jan 87 18:32:35 PST
Date: Mon, 26 Jan 87 18:32:35 PST
From: Thomas Henzinger <tah@linz.Stanford.EDU>
Reply-To: tah%linz.stanford.edu@score.Stanford.EDU
Message-Id: <8701270232.AA02882@linz.stanford.edu>
To: jmc@sail
Subject: Macsyma-manual
I borrowed your Macsyma-manual and will return it tomorrow by noon.
Thanks, Tom
∂27-Jan-87 0945 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Jan 30, 11:00
Place: 252 Margaret Jacks
Topic: Qlisp semantics
∂27-Jan-87 0957 RESTIVO@Score.Stanford.EDU 91 function
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Jan 87 09:57:31 PST
Date: Tue 27 Jan 87 09:52:49-PST
From: Chuck Restivo <Restivo@Score.Stanford.EDU>
Subject: 91 function
To: jmc@Sail.Stanford.EDU
cc: prolog@Score.Stanford.EDU
Message-ID: <12274301668.25.RESTIVO@Score.Stanford.EDU>
[cwr]
Are you responsible for the creation of the 91 function ? Several people
have told me you were but p.411 of Manna's MTC cites Burstall.
-------
∂27-Jan-87 0943 RA Binford
The date for responses on Binford's letter was changed to February 20, 1987.
The letters are on your desk to be signed.
∂27-Jan-87 1048 RA will be back
I need to leave now and will be back at noon.
∂27-Jan-87 1332 LES Final Report on DARPA Equipment Contract
To: Rindfleisch@SUMEX-AIM.STANFORD.EDU, jlh@SONOMA.STANFORD.EDU
CC: BScott@SCORE.STANFORD.EDU, JMC@SAIL.STANFORD.EDU
Contract MDA903-83-C-0188 finished at the end of last November and we owe
them a final report. According to the ONR letter that I received dated
6 January 1987, both of you also got a copy.
There isn't a lot to say, I believe, except to list all the equipment and
summarize the principal purposes for which it was purchased. I guess that
I am stuck with doing CSD's and McCarthy's part and am willing to assemble
the whole report if you two can get someone to write your bit. How does
a done date of February 17 sound?
Les
∂27-Jan-87 1350 RA
Uncomfortable question
I hate to trouble you with this, but it turns out that Zohar is dissatisfied with sagreements
my work and wants to replace me. I don't want to put you in an
awkward position, but since I am working for both of you (and I enjoy
working for you and would like to continue doing so), it is important
for me to know your position and advice in this matter.
∂27-Jan-87 1532 CLT
∂27-Jan-87 1257 JMC
I plan to attend a lecture at 7:30 tonight if it isn't inconvenient for you.
---CLT
No problem
ps - did you take care of your health plan?
Stanford seems to have flushed blue cross
∂27-Jan-87 1819 RESTIVO@Score.Stanford.EDU re: 91 function
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Jan 87 18:18:55 PST
Date: Tue 27 Jan 87 17:59:07-PST
From: Chuck Restivo <Restivo@Score.Stanford.EDU>
Subject: re: 91 function
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 27 Jan 87 11:22:00-PST
Message-ID: <12274390197.10.RESTIVO@Score.Stanford.EDU>
[cwr]
With your consent I would like to include your clarification in a forthcoming
issue of the Digest. I will not include it unless I hear from you.
-------
∂27-Jan-87 1847 LES XPART spooling
To: JMC
CC: ME
∂27-Jan-87 1238 JMC
xpart should issue a maple command instead of espool.
LES - fixed.
∂27-Jan-87 1956 BSCOTT@Score.Stanford.EDU Rutie
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Jan 87 19:56:20 PST
Date: Tue 27 Jan 87 14:17:49-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Rutie
To: JMC@Sail.Stanford.EDU
cc: LES@Sail.Stanford.EDU, BScott@Score.Stanford.EDU
Message-ID: <12274349911.28.BSCOTT@Score.Stanford.EDU>
If Rutie asks to talk with you concerning her performance, I will appreciate
your declining to do so until Les has a chance to discuss it with you.
Thanks,
Betty
-------
∂28-Jan-87 0835 RA Barton Bernstein
There are two of them listed, one in History and one in Center of International
Security, which one is the right one?
∂28-Jan-87 0853 RA hoter.xgp
Where is the file itself?
Thanks,
∂28-Jan-87 0901 RA hoter.xgp
I found the file, so ignore my last msg.
∂28-Jan-87 0913 ULLMAN@Score.Stanford.EDU Ramakrishnan visit
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Jan 87 09:13:24 PST
Date: Wed 28 Jan 87 09:08:04-PST
From: Jeffrey D. Ullman <ULLMAN@Score.Stanford.EDU>
Subject: Ramakrishnan visit
To: jlh@VSOP.Stanford.EDU, linton@Sierra.Stanford.EDU,
ungar@Sierra.Stanford.EDU, horowitz@Sierra.Stanford.EDU,
cheriton@Score.Stanford.EDU, lantz@Score.Stanford.EDU,
nilsson@Score.Stanford.EDU, wiederhold@SUMEX-AIM.Stanford.EDU,
jmc@Sail.Stanford.EDU, papa@Score.Stanford.EDU, pratt@Navajo.Stanford.EDU
Message-ID: <12274555666.36.ULLMAN@Score.Stanford.EDU>
Raghu Ramakrishnan of U. Texas is a candidate for a systems slot,
with a specialization in database/knowledge-base systems.
He will be here on Friday 2/6, with a seminar at 10AM in 352 MJH.
If you are available, I would appreciate your taking a half-hour
to interview him on that day.
Opportunities for a free lunch/dinner are also available.
Rosemary Napier (rfn@sail) is keeping the schedule.
Thanks very much.
---jeff
-------
∂28-Jan-87 0934 RA Judith Lemon
Lemon would like to meet you at your convenience for about 15 minutes to
discuss a new tape idea. What shall I tell her?
Thanks,
∂28-Jan-87 0958 BSCOTT@Score.Stanford.EDU [Rutie Adler <RA@SAIL.STANFORD.EDU>: my schedule ]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Jan 87 09:55:29 PST
Date: Wed 28 Jan 87 09:35:56-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: [Rutie Adler <RA@SAIL.STANFORD.EDU>: my schedule ]
To: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU,
Eppley@Score.Stanford.EDU
Message-ID: <12274560740.26.BSCOTT@Score.Stanford.EDU>
FYI. - Betty
---------------
Return-Path: <RA@SAIL.STANFORD.EDU>
Received: from SAIL.STANFORD.EDU by SU-SCORE.ARPA with TCP; Wed 28 Jan 87 09:29:08-PST
Date: 28 Jan 87 0933 PST
From: Rutie Adler <RA@SAIL.STANFORD.EDU>
Subject: my schedule
To: BS@SAIL.STANFORD.EDU
Betty,
Since Zohar insisted on my taking a lunch break, my schedule from now on
will be 8:00-5:00.
I would like you to realize that I chose to work 9:00-5:00 without a lunch break
in order to avoid tardiness. Because of my back, I don't sleep well and
desperately needed the extra hour in the morning.
I intend to stay in my office during my lunch break; therefore,
on those days when I don't come in at exactly 8:00,
I will cut my lunch hour short by that amount of time.
-------
∂28-Jan-87 1006 RA hoter.xgp (again)
Sorry about the confusion. I just realized that hoter[w87,jmc] is not the
paper but rather your supplement to the 1970 paper. Where can I find the
1970 paper?
Thanks,
∂28-Jan-87 1110 EPPLEY@Score.Stanford.EDU New phone
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Jan 87 11:10:01 PST
Date: Wed 28 Jan 87 11:05:17-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: New phone
To: RA@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU
cc: Eppley@Score.Stanford.EDU
Message-ID: <12274577004.9.EPPLEY@Score.Stanford.EDU>
A trainer from ITS would like to set up a time to show you the many uses
of the ET phone. She is free next Tuesday, and I would like to set up a
time, if you are interested. Please let me know, so that I can make
the arrangements. Thanks
LaDonna
-------
∂28-Jan-87 1127 EPPLEY@Score.Stanford.EDU re: New phone
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Jan 87 11:27:29 PST
Date: Wed 28 Jan 87 11:20:32-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: re: New phone
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 28 Jan 87 11:20:00-PST
Message-ID: <12274579780.9.EPPLEY@Score.Stanford.EDU>
Okay, I have made the appointment for 10:30, Tuesday, February 3. Thanks
LaDonna
-------
∂28-Jan-87 1508 RA hoter file
You now have a file hoter.tex[w76,jmc]
∂28-Jan-87 1552 RA bookstore
I am going to the bookstore.
∂28-Jan-87 1733 LES CSDCF/LOTS
FYI.
∂28-Jan-87 1605 TOM@Score.Stanford.EDU CSDCF/LOTS
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Jan 87 16:05:00 PST
Date: Wed 28 Jan 87 16:00:17-PST
From: Thomas Dienstbier <TOM@Score.Stanford.EDU>
Subject: CSDCF/LOTS
To: les@Sail.Stanford.EDU
Message-ID: <12274630708.13.TOM@Score.Stanford.EDU>
I read a message on Bboard on the merits of lots and did a little comparison
between Lots and CSDCF.
Lots has 9 full time staff 13 students. 3 dec20's, 1 Vax 8650, SCmumble,
and a host of terminals, suns, and micro vax's. They attempt to do
some programming and very little hardware(mostly tip ports and some terminal
work). The students open their own accounts (not by staff).
CSDCF has 9 full time staff 5 students. 3 dec20's, 1 kl10,2 vax 780's,
3 vax750's ,bunches of suns, laser printers, terminals and in addition
7 vax 750s that are on maintenance. We do open up accounts and then keep track
of them with monthly billing for insiade and outside users. We do a lot of
programming and all the hardware. We are also spred out in 3 geographical
areas. We also keep track of most of the equipment for the department which
is no easy task.
If lots is low over head we must be poverty and overworked.
tom
-------
∂28-Jan-87 1754 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
A QUERY ANSWERING ALGORITHM
FOR CIRCUMSCRIPTIVE AND CLOSED-WORLD THEORIES
Teodor C. Przymusinski
University of Texas at El Paso
<ft00@utep.bitnet>
Thursday, January 29, 4pm
Bldg. 160, Room 161K
McCarthy's theory of circumscription appears to be the most powerful
among various non-monotonic logics designed to handle incomplete and
negative information in knowledge representation systems. In this
presentation we will describe a query answering algorithm for
circumscriptive theories.
The algorithm is based on a modified version of ordered linear resolution
(OL-resolution), which we call a MInimal model Linear Ordered resolution
(MILO-resolution). MILO-resolution constitutes a sound and complete procedure
to determine the existence of minimal models satisfying a given formula.
Our algorithm is the first query evaluation algorithm for general
circumscriptive theories. The Closed-World Assumption (CWA) and its
generalizations, the Generalized Closed-World Assumption (GCWA) and
the Extended Closed-World Assumption (ECWA), can be considered as
special forms of circumscription. Consequently, our algorithm also
applies to answering queries in theories using the Closed-World Assumption
and its generalizations. Similarly, since prioritized circumscription
is equivalent to a conjunction of (parallel) circumscriptions, the
algorithm can be used to answer queries in theories circumscribed by
prioritized circumscription.
-----------
Przymusinski will also give another talk related to the theory of
circumscription:
∂26-Jan-87 2350 MILTON@SRI-STRIPE.ARPA Database Research Seminar 1/30
Received: from SRI-STRIPE.ARPA by SAIL.STANFORD.EDU with TCP; 26 Jan 87 23:49:54 PST
Date: Mon 26 Jan 87 23:46:58-PST
From: Jack Milton <MILTON@SRI-STRIPE.ARPA>
Subject: Database Research Seminar 1/30
To: CS545: ;
Message-ID: <12274191376.11.MILTON@SRI-STRIPE.ARPA>
We will meet this Friday at 3:15 in room 352 Margaret Jacks Hall --
ON THE SEMANTICS OF STRATIFIED
DEDUCTIVE DATABASES AND LOGIC PROGRAMS
Teodor C. Przymusinski
Department of Mathematical Sciences
University of Texas, El Paso, TX 79968
<ft00@utep.bitnet>
A model-theoretic approach to the theory of deductive databases
and logic programs is based on the idea of representing a database
as a set DB of formulas of first-order logic and associating with DB
a set M(DB) of one or more models of DB, which describe the
declarative meaning of the database or, in other words, its
semantics. A sentence F is considered to be true in the database
if and only if it is satisfied in all models M from M(DB).
We introduce the notion of a perfect model of a deductive database DB
and show that the set PERF(DB) of perfect models of DB provides a
correct intended semantics for such databases, incorporating a natural
form of the closed-world assumption. We extend the notion of stratified
programs - introduced by Apt, Blair and Walker and, independently, by
Van Gelder and by Naqvi - to deductive databases and prove that
every stratified database has perfect models and that every stratified
logic program has exactly one such model. Moreover, this
unique perfect model coincides with the model proposed by Apt et al.,
Van Gelder and Naqvi, providing an additional justification of their
approach. We show that perfect models are in fact models of
McCarthy's prioritized circumscription. and provide a procedural
characterization of perfect models.
Furthermore, we introduce the class of locally stratified databases,
which appears to significantly extend the class of stratified databases
and show that all our results also apply to this broader class.
∂29-Jan-87 0813 RA
hoter.tex[w76,jmc]
This file is protected so I could not get into it. The following should
replace the top of the last page of the paper:
\centerline{This version of the HOTER was printed on
\ifcase\the\month \or January\or February\or March\or April\or May\or June\or
July\or August\or September\or October\or November\or December\fi
\ \the\day, \the\year.}
Rutie
-----
∂29-Jan-87 1034 RA Re: unprotect
[Reply to message recvd: 29 Jan 87 09:43 Pacific Time]
Thanks, it worked. By the way, out of curiosity, if unprotecting is so easy,
why protect at all?
∂29-Jan-87 1530 RA leaving
It is Thursday and I will be leaving shortly, is there anything you want me
to do before I leave?
∂30-Jan-87 0827 EPPLEY@Score.Stanford.EDU Rutie
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 08:27:07 PST
Date: Fri 30 Jan 87 08:22:17-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: Rutie
To: JMC@Sail.Stanford.EDU
cc: Eppley@Score.Stanford.EDU
Message-ID: <12275071618.30.EPPLEY@Score.Stanford.EDU>
Rutie has called in sick today. If you need help, please let me know.
LaDonna
-------
∂30-Jan-87 0829 BSCOTT@Score.Stanford.EDU Work Schedule
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 08:29:15 PST
Date: Fri 30 Jan 87 08:24:23-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Work Schedule
To: RA@Sail.Stanford.EDU
cc: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU
Message-ID: <12275072002.27.BSCOTT@Score.Stanford.EDU>
Rutie, it is not satisfactory for you to announce that you are leaving early.
ANY deviation from the 8:00 to 5:00 with one hour for lunch schedule which
you said you preferred must be approved in advance. Please observe this
policy which applies to all staff members.
Thanks,
Betty
-------
∂30-Jan-87 0901 JMC
qlisp
∂30-Jan-87 0901 JMC
ticket
∂30-Jan-87 1344 HEGARTY@Score.Stanford.EDU Emacs
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 13:42:16 PST
Date: Fri 30 Jan 87 13:37:19-PST
From: Paul Hegarty <HEGARTY@Score.Stanford.EDU>
Subject: Emacs
To: JMC@Sail.Stanford.EDU
Message-ID: <12275128970.44.HEGARTY@Score.Stanford.EDU>
The Gosling Emacs manual is too big to send through the mail, so I have
put it in your directory on Score. It is called EMACS.DOC.
Enjoy!
... Paul
-------
∂30-Jan-87 1403 VAL
See milest[1,val]
∂30-Jan-87 1458 JJW Hertz renewal
I've left a form on your desk for renewal of my Hertz fellowship. It was
recently reinstated for this year, since I haven't finished by now as I
expected to do a year ago; and Carolyn Tajnai would like me to keep asking
for renewal even though I hope to be finished in less than a year.
∂30-Jan-87 1344 RICHARDSON@Score.Stanford.EDU Saul Amarel
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 13:42:02 PST
Date: Fri 30 Jan 87 13:34:09-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Saul Amarel
To: jmc@Sail.Stanford.EDU
Message-ID: <12275128392.20.RICHARDSON@Score.Stanford.EDU>
Saul Amarel will be visiting us on Tuesday, Feb. 10 at 3:00. Will you be
able to join Nils for that meeting?
-Anne
-------
∂30-Jan-87 1709 TAJNAI@Score.Stanford.EDU Important Message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 17:07:22 PST
Date: Fri 30 Jan 87 16:26:20-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Important Message
To: Forum-Speakers: ;
Message-ID: <12275159737.55.TAJNAI@Score.Stanford.EDU>
The people at Tresidder ran into some very serious scheduling
problems. I agreed that we would hold our Thursday morning "B"
sessions in Dinkelspiel rather than Cypress. They are trying to get
Dink for the afternoon also, but we do not have confirmation.
Advantages: more room for students to attend; more comfortable
disadvantages: logistical problems of transporting a/v equipment, etc.
It is important for us to know exactly what equipment you need.
The standard equipment:
1 overhead
1 screen
table for overhead
lighted pointer
speaker system
We have one request for 2 overheads and 2 screens at a time.
If you need 2 overheads and 2 screens and have not notified Katie
(Macmilk), please do so.
If you have not notified Katie that you need a 35 mm slide projector,
please do so.
If you have not notified Katie about any other a/v needs, it is
important to let her know as soon as possible.
-------
∂30-Jan-87 1711 BSCOTT@Score.Stanford.EDU Rutie
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 17:09:34 PST
Date: Fri 30 Jan 87 16:46:17-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Rutie
To: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU
cc: BScott@Score.Stanford.EDU
Message-ID: <12275163370.27.BSCOTT@Score.Stanford.EDU>
Rutie has counter-offered to give me a letter of resignation if we will allow
her to stay in her current job until July 31. I told her that I thought
the May 1 termination date is reasonable and that July 31 is unreasonable.
It appears that I will have to start what Personnel calls "disciplinary
procedures", meaning documenting all the errors she makes, etc.
I intend to tell her on Monday that May 1 is the date, and that if this is
not acceptable to her then the disciplinary procedure will begin.
Betty
-------
∂30-Jan-87 1732 TAJNAI@Score.Stanford.EDU re: Important Message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Jan 87 17:32:42 PST
Date: Fri 30 Jan 87 17:17:43-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: re: Important Message
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 30 Jan 87 17:12:00-PST
Message-ID: <12275169093.55.TAJNAI@Score.Stanford.EDU>
No, John, but I put the advisors on the distribution list.
I believe you are introducing Joe Weening.
Carolyn
p.s. I heard your wonderful news. Not sure if it has been
announced yet, but I'm so happy it has finally happened.
Congratulations!!
-------
∂31-Jan-87 0927 RPG Diversion
From your remarks yesterday I take it you do not want us to do the
message-passing diversion for Squires, is that correct? We are in
a position to do that diversion right now. I will proceed whatever
way you suggest.
-rpg-
∂31-Jan-87 1017 CLT
I ordered a refill for Timothy's ointment at T&C pharmacy
(#399896). Its in Timothy's name
Also there are pictures there (in my name).
∂31-Jan-87 1416 TAJNAI@Score.Stanford.EDU re: Important Message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 31 Jan 87 14:16:46 PST
Date: Sat 31 Jan 87 14:11:57-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: re: Important Message
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 30 Jan 87 18:08:00-PST
Message-ID: <12275397417.17.TAJNAI@Score.Stanford.EDU>
Joe is the second speaker on Thursday afternoon,
session starts at 1:30; Joe should start at 1:50.
Cypress Lounge Tresidder.
Eric Muller is the first speaker, Joe the second. Terry Winograd
is session chairman.
Carolyn
-------
∂31-Jan-87 1753 LES
∂30-Jan-87 1438 JMC
I observed a satisfied user take output from Rover.
LES - I think that I overstated the fragility of the Dovers. Plover seems
to be dead forever and Rover has been dead for most of its "life" but is
revived periodically.
∂01-Feb-87 0839 NILSSON@Score.Stanford.EDU student reps
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Feb 87 08:39:06 PST
Date: Sun 1 Feb 87 08:34:07-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: student reps
To: Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
WINOGRAD@CSLI.Stanford.EDU, JMC@Sail.Stanford.EDU,
Rosenbloom@SUMEX-AIM.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
TOB@Sail.Stanford.EDU, Shortliffe@SUMEX-AIM.Stanford.EDU
Message-ID: <12275598060.13.NILSSON@Score.Stanford.EDU>
What do y' all think of having an AI student representative
or two attend all or part of our March 8 AI retreat. (I think
it's a good idea--mainly because I find student suggestions more
often helpful and stimulating than bothersome.) -Nils
-------
∂01-Feb-87 1212 RPG diversion
The first version of Qlisp (QLET-only) could be running in a few months.
The message-passing hack could be running in 2 weeks, if we decided to
do it.
-rpg-
∂01-Feb-87 1238 TAJNAI@Score.Stanford.EDU re: Important Message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Feb 87 12:38:39 PST
Date: Sun 1 Feb 87 12:33:47-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: re: Important Message
To: JMC@Sail.Stanford.EDU
cc: winograd@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 31 Jan 87 14:46:00-PST
Message-ID: <12275641691.20.TAJNAI@Score.Stanford.EDU>
Zohar will introduce Eric Muller, who speaks just before Joe Weening.
Would it be better to ask Zohar -- is he more familiar with Joe's work?
Or Dick Gabriel?
John, Terry, what do you think?
Carolyn
-------
∂01-Feb-87 1513 RLG learning
in the Advice Taker paper, you state that your "ultimate objective is to make
programs that learn from their experience as effectively as humans do"
this is precisely the sort of goal i have in mind when i say my interest
is in "learning".
this leads to two questions:
(1) is this still your ultimate goal?
i.e. is what you're doing now primarily subordinate to this goal?
and if so, briefly, how?
(2) if yes to (1), why (roughly) is your current direction the best
way to approach learning?
if no to (1), what changed your goal?
thanx,
∂01-Feb-87 1604 binford@whitney.stanford.edu student reps
Received: from WHITNEY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Feb 87 16:04:13 PST
Received: by whitney.stanford.edu; Sun, 1 Feb 87 16:05:40 PST
Date: Sun, 1 Feb 87 16:05:40 PST
From: Tom Binford <binford@whitney.stanford.edu>
To: NILSSON@score.stanford.edu
Cc: Feigenbaum@sumex-aim.stanford.edu, Genesereth@sumex-aim.stanford.edu,
WINOGRAD@csli.stanford.edu, JMC@sail.stanford.edu,
Rosenbloom@sumex-aim.stanford.edu, Buchanan@sumex-aim.stanford.edu,
TOB@sail.stanford.edu, Shortliffe@sumex-aim.stanford.edu
In-Reply-To: Nils Nilsson's message of Sun 1 Feb 87 08:34:07-PST
Subject: student reps
Sure, seems ok.
∂01-Feb-87 2117 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 1 February 1987
Previous Balance 4.00
Payment(s) 4.00 (check 1/17/87)
-------
Current Charges 0.90 (coffee, tea and hot chocolate)
4.00 (bicycle lockers)
-------
TOTAL AMOUNT DUE 4.90
Please deliver payments to Debbie Woodward, room 040, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Note: Payment recordation takes up to three weeks after delivery of a payment
(but not beyond the next billing date).
Bills are payable upon presentation. Interest of 1.0% per month will be
charged on balances remaining unpaid 25 days after bill date above.
An account with a credit balance earns interest of .33% per month,
based on the average daily balance.
∂01-Feb-87 2204 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: student reps
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Feb 87 22:04:11 PST
Date: Sun 1 Feb 87 22:15:46-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: student reps
To: NILSSON@SCORE.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
TOB@SAIL.STANFORD.EDU, Shortliffe@SUMEX-AIM.STANFORD.EDU
In-Reply-To: <12275598060.13.NILSSON@Score.Stanford.EDU>
Message-ID: <12275747638.31.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Depends on who you ask. Who did you have in mind?
Ed
-------
∂02-Feb-87 0900 JMC
ticket
∂02-Feb-87 0931 WINOGRAD@CSLI.Stanford.EDU Re: student reps
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 09:31:03 PST
Date: Mon 2 Feb 86 09:30:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: Re: student reps
To: NILSSON@SCORE.STANFORD.EDU
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU,
Buchanan@SUMEX-AIM.STANFORD.EDU, TOB@SAIL.STANFORD.EDU,
Shortliffe@SUMEX-AIM.STANFORD.EDU
Sounds good to me. --t
∂02-Feb-87 0942 BUCHANAN@SUMEX-AIM.STANFORD.EDU Re: student reps
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 09:42:26 PST
Date: Mon 2 Feb 87 09:39:48-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.STANFORD.EDU>
Subject: Re: student reps
To: NILSSON@SCORE.STANFORD.EDU
cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, TOB@SAIL.STANFORD.EDU,
Shortliffe@SUMEX-AIM.STANFORD.EDU
In-Reply-To: <12275598060.13.NILSSON@Score.Stanford.EDU>
Message-ID: <12275872164.40.BUCHANAN@SUMEX-AIM.STANFORD.EDU>
I agree that students' suggestions are often helpful. Would you
want to reserve time without students at the end of the day, however,
for confidential items -- or won't there be any?
bgb
-------
∂02-Feb-87 0957 BSCOTT@Score.Stanford.EDU Benefits Information
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 09:56:29 PST
Date: Mon 2 Feb 87 09:44:14-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Benefits Information
To: JMC@Sail.Stanford.EDU
cc: BScott@Score.Stanford.EDU
Message-ID: <12275872971.38.BSCOTT@Score.Stanford.EDU>
John, I cannot find your doctor's name in the Directory of Preferred
Physicians under the Blue Shield Plan, but the Directory is dated July,
1986, so I suggest you ask the benefits specialist.
I could not get the name of a benefits specialist. There are four of them
and they rotate the calls. So I left your name and number, and you should
hear from one of them about an appointment.
Betty
-------
∂02-Feb-87 1020 TAJNAI@Score.Stanford.EDU Visit from Los Alamos
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 10:20:04 PST
Date: Mon 2 Feb 87 10:04:48-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Visit from Los Alamos
To: Nilsson@Score.Stanford.EDU, Jlh@Sonoma.Stanford.EDU,
Ullman@Score.Stanford.EDU, Ganapathi@Sierra.Stanford.EDU,
JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU, CLT@Sail.Stanford.EDU,
Cheriton@Pescadero.Stanford.EDU, lantz@Gregorio.Stanford.EDU,
linton@Amadeus.Stanford.EDU, DCL@Sail.Stanford.EDU
cc: rowland@Sonoma.Stanford.EDU, RFN@Sail.Stanford.EDU,
Ross@Pescadero.Stanford.EDU, RBA@Sail.Stanford.EDU,
diaz@Score.Stanford.EDU, tajnai@Score.Stanford.EDU
Message-ID: <12275876713.19.TAJNAI@Score.Stanford.EDU>
Joan Prommel, Joe Fasel and Dennis Brockway want to visit Feb. 9-11.
They are interested in joining the Computer Forum. Because it is
Forum Week, my staff and I are unable to coordinate the visit,
therefore, Joan Prommel will contact you individually. I regret
that we are not able to "roll out the red carpet".
The times are: Monday afternoon, all day Tuesday, and Wed. morning.
Her email address is "jmp%Teton"@lanl.arpa. It would be helpful if
you could send her a suggested time, otherwise, she will contact you.
Incidentally, if one of you wishes to act as host and coordinate the
visit, then you will share in the finder's fee if they join.
The following is her message:
Date: Thu, 29 Jan 87 15:56:41 MST
From: jmp%teton@LANL.ARPA (Joan Prommel)
To: tajnai@score.stanford.edu
Subject: VISIT
Given the problem with the fact that we are not yet part of
the Affiliate program, we have decided that it would be
best to come to visit the following week, that is the
week of February 9. It appears this is also better timing
to meet with some of the professors we would like to contact.
(Those planning to visit are Dennis Brockway, Joe Fasel and
Joan Prommel. We work in the programming environments
group in the Computing Division. At Los Alamos, we develop
software and conduct research on machines ranging from
Suns to Symbolics machines to CRI X-MP 4/16s to experimental
machines. We are interested in both distributed computing
and parallel processing. Dennis and I are technical supervisors.
Joe Fasel is one of our language researchers.)
During our visit, we would like to learn more about the
affiliate program, discuss research activities for potential
collaborate activities, and to meet with graduates students, (NOTE: I told
Joan that we do not schedule meetings with students for non-Forum
companies)
especially those in the area of compiler construction.
Los Alamos has committed to a new project . . . that of becoming
a center of excellence in compiler design and language research.
We would like to discuss our plans and opportunities during
our trip.
We would like to meet with the following people, if possible.
We are not sure if contacting them directly is appropriate,
or if you prefer that we go through your office. They include:
o Professor Nilsson
o Professor Hennessy
o Professor Ullman
o Professor Ganapathi
o Professors McCarthy, Earnest, Talcott (QLISP)
o Professors Cheriton, Lantz, Linton, Luckham
It appears that Monday afternoon, Tuesday, and Wednesday morning,
Feb. 9-11 are best for us.
Joan Prommel
(505) 667-6961
Carolyn
-------
∂02-Feb-87 1209 RLG learning
from what you say that the work you are doing
may well be what I have in mind when I say I'm interested in learning.
i.e. i wasn't using the word learning in it's AI subfield designator meaning,
but rather its common usage meaning.
i think my interest is strongest at the intersection of the two approaches you
mention (1. attacking learning directly, 2. improving epistemology). i.e. by
attacking learning directly I would expect to learn what improvements in
epistemology are most needed, and studying the epistemology may give
insights into how to approach learning.
all of this is in abstract vague language because I have not gotten deeply
enough into the learning literature.
there are definitely dimensions along which I would be foolish not to stay here.
∂02-Feb-87 1209 RLG winograd
i'm writing a paper for winograd. he asked that we not ramble about our
opinions of the material, but simply apply his ideas to some area
of CS.
Thus, I'm writing a criticism (which i don't agree with) of the work
in logic. I included a disclaimer reprinted below, but i wanted to
also tell you directly that the criticism I have written is one I don't
agree with, in case the paper should pop up again sometime.
Since Terry did not want our opinions, but only his ideas applied,
I presume he doesn't mind that I disagree with what I wrote.
In fact, i disagree with his criticisms in general.
bob.
\bf \noindent Disclaimer: The criticisms I have presented are intended to
be those covered in CS378 and are not necessarily my own opinions.
∂02-Feb-87 1218 TAJNAI@Score.Stanford.EDU Last minute reminders
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 12:18:51 PST
Date: Mon 2 Feb 87 12:00:15-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: Last minute reminders
To: Forum-Speakers: ;
Message-ID: <12275897731.19.TAJNAI@Score.Stanford.EDU>
Over the weekend I learned that some of the speakers have not confirmed
with their advisors who will be doing their introductions. It is
important to confirm:
1. Who will be introducing you
2. If there is a substitute, then the session chairman needs to know.
One other important item:
If you are unable to attend one of the meal functions that you have
made a reservation for, PLEASE notify me immediately. Last year
we had 30 no-shows at the banquet, and it cost us $900. We have
to guarantee a certain number.
Carolyn
-------
∂02-Feb-87 1307 TAJNAI@Score.Stanford.EDU [Dick Gabriel <RPG@SAIL.STANFORD.EDU>: Presentation ]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 13:06:46 PST
Date: Mon 2 Feb 87 13:01:54-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: [Dick Gabriel <RPG@SAIL.STANFORD.EDU>: Presentation ]
To: winograd@CSLI.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12275908953.40.TAJNAI@Score.Stanford.EDU>
Joe is taken care of.
---------------
Return-Path: <RPG@SAIL.STANFORD.EDU>
Received: from SAIL.STANFORD.EDU by SCORE.STANFORD.EDU with TCP; Mon 2 Feb 87 12:15:36-PST
Date: 02 Feb 87 1220 PST
From: Dick Gabriel <RPG@SAIL.STANFORD.EDU>
Subject: Presentation
To: tajnai@SCORE.STANFORD.EDU, JJW@SAIL.STANFORD.EDU
I can do it. What sorts of things should I say?
-rpg-
-------
∂02-Feb-87 1416 VAL
John, I have a cold and am staying home today. I hope I'll be ok tomorrow.
Meanwhile, if you want me to write something else for the proposal today,
send me a message.
∂02-Feb-87 1515 RLG winograd
indeed the problem is having the time.
i'd certainly write something i agreed with if i had the time.
although in the hard to pin down presentation of his objections it would
be a bit of work. some of the examples are certainly interesting, as you say.
∂02-Feb-87 1733 NILSSON@Score.Stanford.EDU robotics
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 17:32:55 PST
Date: Mon 2 Feb 87 16:32:36-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: robotics
To: jmc@Sail.Stanford.EDU, feigenbaum@SUMEX-AIM.Stanford.EDU,
buchanan@SUMEX-AIM.Stanford.EDU, genesereth@SUMEX-AIM.Stanford.EDU,
winograd@CSLI.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12275947311.27.NILSSON@Score.Stanford.EDU>
As senior members of our AI faculty, I'd like your opinion on the following
proposal. (I have already solicited Tom Binford's opinion.)
With the arrival of Jean-Claude Latombe I look forward to our being much
more organized in robotics. Being more organized means both doing a better
job planning for the future and a better job in dealing with student
needs, visitors, research associates, laboratory needs, etc.
I propose to set up something called the "Robotics and Artificial Intelligence
Laboratory" and install J-C Latombe as director. The lab would be modelled
loosely after the KSL (an idea suggested by Ed). It would have three main
parts (without hard boundaries between the parts), namely 1) vision and
mobility with Tom Binford as leader; 2) manipulation with Ousamma Khatib
as leader; and 3) high-level reasoning and robotics with J-C Latombe
as leader (in addition to his overall leadership of the whole lab). This
plan has already been tentatively discussed with Latombe, Binford, and
Khatib, and they are in agreement.
The reason for the phrase "artificial intelligence" in the name of the
lab is to emphasize the important role that AI must begin to play
in robotics.
Latombe and a secretary will have offices in Cedar Hall.
Sound ok?
-Nils
-------
∂02-Feb-87 1800 WINOGRAD@CSLI.Stanford.EDU Re: robotics
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 18:00:49 PST
Date: Mon 2 Feb 86 17:58:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: Re: robotics
To: NILSSON@SCORE.STANFORD.EDU
Cc: nilsson@SCORE.STANFORD.EDU, jmc@SAIL.STANFORD.EDU,
feigenbaum@SUMEX-AIM.STANFORD.EDU,
buchanan@SUMEX-AIM.STANFORD.EDU,
genesereth@SUMEX-AIM.STANFORD.EDU,
winograd@CSLI.STANFORD.EDU
If the people involved think it's good, it sounds great to me. --t
∂02-Feb-87 2300 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: robotics
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Feb 87 22:57:33 PST
Date: Mon 2 Feb 87 22:57:56-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: robotics
To: NILSSON@SCORE.STANFORD.EDU, jmc@SAIL.STANFORD.EDU,
buchanan@SUMEX-AIM.STANFORD.EDU, genesereth@SUMEX-AIM.STANFORD.EDU,
winograd@CSLI.STANFORD.EDU
cc: feigenbaum@SUMEX-AIM.STANFORD.EDU
In-Reply-To: <12275947311.27.NILSSON@Score.Stanford.EDU>
Message-ID: <12276017458.24.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Nils, the conception is very good. The name might cause us all some problems
down the road 12-24 months hence (for reasons that are too complex to go into
in this message this late in the evening, but which I will explain to all
at the retreat). I would suggest "Artificial Intelligence IN Robotics" rather
than "Robotics AND Artificial Intelligence". I think you can see the
obvious problem with the AND.
Ed
-------
∂03-Feb-87 0731 NILSSON@Score.Stanford.EDU cs520
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 07:31:26 PST
Date: Tue 3 Feb 87 07:26:34-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: cs520
To: Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
WINOGRAD@CSLI.Stanford.EDU, JMC@Sail.Stanford.EDU,
Rosenbloom@SUMEX-AIM.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
TOB@Sail.Stanford.EDU, Shortliffe@SUMEX-AIM.Stanford.EDU
Message-ID: <12276110051.16.NILSSON@Score.Stanford.EDU>
Many students have approached Mike Genesereth and me with the question
"How can we learn more about the other approaches to AI (other than
the so-called 'logicist' one)?" As we'll no doubt discuss at the
retreat, there are other courses that we can organize. There is also
the "AI Research Seminar," cs520 that I volunteered to run this
Spring. I mentioned at our earlier mtg that I was considering using
the seminar this time to display the various points of view about AI.
In thinking about this some more, it seems to me it would be fun to
have a kind of "AI Firing Line." I would host the events, and each
week we would have a different luminary describing his/her point of
view. The suggested format would be: 1) the luminary would take
20 minutes to put forth the main features, strengths, weaknesses, etc.
of his/her approach to AI, 2) I would attempt to raise discussion
points that I think were not covered adequately yet (20 minutes also),
3) the luminary would then take 10 minutes of questions from the floor.
I'm no Buckley and I wouldn't see my role as a debater in all of this, but
I would try to ask some penetrating questions. So, what do you all
think and would you agree to be a "luminary."? How about outside-of-Stanford
guests?
-Nils
-------
∂03-Feb-87 0926 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: cs520
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 09:26:17 PST
Date: Tue 3 Feb 87 09:26:21-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: cs520
To: NILSSON@SCORE.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Buchanan@SUMEX-AIM.STANFORD.EDU,
TOB@SAIL.STANFORD.EDU, Shortliffe@SUMEX-AIM.STANFORD.EDU
In-Reply-To: <12276110051.16.NILSSON@Score.Stanford.EDU>
Message-ID: <12276131858.67.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Nils,
I would agree to be a "luminary". However, I think I would have a point of
view virtually identical with Bruce Buchanan's, and almost identical with
Ted Shortliffe's. So something would have to be done to adjust for this.
I don't at all like the "firing line" approach. I've taken the stance at
all times in the past not to be confrontational with the research
oreintations that are not of my choice. I simply offer my own positions and
expositions and let others offer theirs.
For the most part others have done the same. Certainly John McCarthy (with the
exception of one minor attack on MYCIN in a public speech). Terry Winograd
has been highly confrontational in recent years, but his confrontation is so
broad that it blankets the entire field and does not discriminate among the
issues of research methodology (clobbers them all).
Concerning outsiders, why not? If we select them carefully. My list would
include: Lenat, DeKleer, and John Seeley Brown. Also perhaps a philosopher/
linguist like Perry or Barwise (are they "outsiders"?)
Ed
-------
∂03-Feb-87 0931 WINOGRAD@CSLI.Stanford.EDU Re: cs520
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 09:30:29 PST
Date: Tue 3 Feb 86 09:25:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: Re: cs520
To: NILSSON@SCORE.STANFORD.EDU
Cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU,
Buchanan@SUMEX-AIM.STANFORD.EDU, TOB@SAIL.STANFORD.EDU,
Shortliffe@SUMEX-AIM.STANFORD.EDU
Sure, sounds fine. Newell will be speaking at a symposium here on April
23/24, so you should try to catch him during that visit. I don't know
if Rumelhart is starting to spend any time here on visits, but you
should get him or someone with connectionist leanings. Stefik might be
interesting to present his "Knowledge medium" ideas, and Lenat is around
from time to time (I'm emphasizing here the approaches not as fully
represented among our regular and consulting faculty. People like
Rosenschein, Hayes, etc. are also good immediate candidates along with
the faculty).
∂03-Feb-87 0949 RA LA trip
The tickets for your trip tomorrow are on your desk.
∂03-Feb-87 1012 coraki!pratt@sun.com Mitchell on March 10
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 10:11:29 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Tue, 3 Feb 87 10:09:51 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA03905; Tue, 3 Feb 87 09:51:44 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA06214; Tue, 3 Feb 87 09:53:28 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA21497; Tue, 3 Feb 87 09:52:25 PST
Date: Tue, 3 Feb 87 09:52:25 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8702031752.AA21497@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell on March 10
John Mitchell is set for Tuesday March 10. I propose that he talk at
1:45 pm. Let me know when you'd like to talk with him -- the schedule
is presently all open except for the 1st half of the afternoon (say up
to 3:15).
-v
∂03-Feb-87 1023 ullman@navajo.stanford.edu Maley
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 10:23:04 PST
Received: by navajo.stanford.edu; Tue, 3 Feb 87 10:21:47 PST
Date: Tue, 3 Feb 87 10:21:47 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Maley
To: fndsch@navajo.stanford.edu
I looked at his folder. The research area (silicon layout)
is getting old-fashioned, and the results don't seem sufficiently
impressive to go ape. There were no letters in the file.
I forget why it was important to look at this case now,
but I would suggest we wait for the letters and let nature take its
course.
---jeff
∂03-Feb-87 1025 ullman@navajo.stanford.edu Raghu Ramakrishnan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 10:25:50 PST
Received: by navajo.stanford.edu; Tue, 3 Feb 87 10:24:30 PST
Date: Tue, 3 Feb 87 10:24:30 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Raghu Ramakrishnan
To: fndsch@navajo.stanford.edu
There is a systems candidate, RAghu Ramakrishnan from UT,
who has done some very exciting work in algorithms for logical
query evaluation (well at least he's a coauthor on a lot of
first-rate papers). He's giving a talk at 10AM Friday 2/6
in 352 MJH. If anybody wants to talk to him,
please contact Rosemary Napier (rfn@sail) for a slot.
Lunch and dinner are also open.
---jeff
∂03-Feb-87 1153 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
THE SYNTHESIS OF DIRTY LISP PROGRAMS
Richard Waldinger
Artificial Intelligence Center
SRI International
Thursday, February 5, 4pm
Bldg. 160, Room 161K
Most work in program synthesis has focused on the
derivation of applicative programs, which return an
output but produce no side effects. In this talk we
turn to the synthesis of imperative programs, which
may alter data structures and produce other side effects
as part of their intended behavior. We concentrate on
"dirty LISP," an imperative LISP with assignment and
destructive list operations (rplaca and rplacd).
We treat dirty LISP with the same deductive approach
we use for the relatively clean applicative programs.
For this purpose, we introduce a new situational
logic, called "dirty-LISP theory." The talk will
emphasize how to represent instructions and specifications
in this theory.
∂03-Feb-87 1259 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: Accuracy in Academia
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 12:56:08 PST
Date: Tue 3 Feb 87 12:56:23-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: Re: Accuracy in Academia
To: JMC@SAIL.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 3 Feb 87 10:03:00-PST
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12276170094.78.CRISPIN@SUMEX-AIM.STANFORD.EDU>
I don't know if they have renounced this, but at one time AIA was
talking about having their members sit in on classes and challenge the
professor when they perceived an "anti-American statement" being made.
Needless to say, this can be very disruptive to any class.
I object to "political correctness" being applied to any professor.
By their own admission, AIA feels that the "anti-American bias" is left-
wing. This in itself should discredit AIA; it implies that their basis
of judgement is solely on right-wing credentials rather than on a
politically moderate viewpoint that tolerates some amount of deviation
either way.
The inevitable suspicion is that AIA would use whatever pressure
they can muster against only left-wing viewpoints and turn a blind eye
to far right viewpoints.
I don't think that students are hurt all that much by being exposed
to a wide range of political viewpoints from their professors, especially
if they learn to make their own judgements instead of taking what the
professor says on blind faith.
Why don't you make your $30 into $35 and send it to American Atheists?
the major lawsuits AA are fighting now are to stop "creation science" and
laws restricting the teaching of evolution.
-- mark --
-------
∂03-Feb-87 1340 berglund@pescadero.stanford.edu Accuracy in Academia
Received: from PESCADERO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 13:40:29 PST
Received: by pescadero.stanford.edu with Sendmail; Tue, 3 Feb 87 13:35:34 pst
Date: Tue, 3 Feb 87 13:35:34 pst
From: Eric Berglund <berglund@pescadero.stanford.edu>
Subject: Accuracy in Academia
To: su-etc@score
Cc: jmc@sail
Is this organization's principle purpose to publish counterarguments
and distribute them on the campuses where the supposed violators of
truth teach? Or is it to influence the funding agencies and journal
referees who have professional contact with the targets of AIA?
Does it make any attempt to do the latter? If so, I would be against
supporting such an organization, because I do not believe that all the
people who referee papers, and all who make funding decisions, are able
to discount political considerations when they ought to.
--Eric
∂03-Feb-87 1343 G.GVOZDEV@LEAR.STANFORD.EDU Re: Accuracy in Academia
Received: from LEAR.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 13:43:12 PST
Date: Tue 3 Feb 87 13:38:29-PST
From: Gary Holden <G.GVOZDEV@LEAR.STANFORD.EDU>
Subject: Re: Accuracy in Academia
To: JMC@SAIL.STANFORD.EDU, su-etc@LEAR.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 3 Feb 87 10:03:00-PST
Message-ID: <12276177757.31.G.GVOZDEV@LEAR.STANFORD.EDU>
I would be interested to know what counts as "anti-American" and
what counts as "bias". My impression is that "Accuracy in Academia" is
just another NEWSPEAK term for a group of right-wing witch-hunters who
view any form of American self-criticism as treasonable activity. In
view of the knee-jerk pro-American bias of most American cultural
institutions, a little self-criticism in the relatively marginal
area of academia should be encouraged rather than stomped on.
I realize this is opinion rather than argument and that I
haven't addressed your point. I therefore don't expect to convince
you not to send them $30.
Gary
P.S. I'm not American, by the way, so maybe I'm biased.
-------
∂03-Feb-87 1448 gana@sonoma.stanford.edu
Received: from SONOMA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 14:48:13 PST
Received: by sonoma.stanford.edu; Tue, 3 Feb 87 14:48:46 PST
Date: Tue, 3 Feb 87 14:48:46 PST
From: Mahadevan Ganapathi <gana@sonoma.stanford.edu>
To: jmc@sail.stanford.edu
re: coordinating Joan Prommel (from Los Alamos) visit 9-11 Feb.
please let me know your preferred time-slots so that I can determine and
schedule conflicts.
The following slots are taken:
Mon: 2 p.m.
Tue: 2.45, 4.
thank you.
∂03-Feb-87 1506 pae@shasta.stanford.edu Re: Accuracy in Academia
Received: from SHASTA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 15:06:32 PST
Received: by shasta.stanford.edu; Tue, 3 Feb 87 15:06:56 PST
Date: Tue, 3 Feb 87 15:06:56 PST
From: Peter Eichenberger <pae@shasta.stanford.edu>
To: JMC@sail.stanford.edu
Subject: Re: Accuracy in Academia
Newsgroups: su.etc
In-Reply-To: <15318@glacier.STANFORD.EDU>
Organization: Stanford University
Cc:
I think that you need to agree with more than just criticisms in an
orginzations brochure before you send them $30. You may wish to check
out what the organization actually does.
While, I do not have any first hand knowledge of this organization,
from what I remember of newspaper articles of a year or so ago, they
seemed to be less interested in accuracy than in encouraging their own
political bias in the class room. While their methods might have
little effect on a tenured profoessor, I could imagine that some
assistant profs. might view them as harassment or intimidation.
As to whether their political view (or any political view) is pro- or
anti- American, that is a different debate.
∂03-Feb-87 1526 ullman@navajo.stanford.edu Raghu R.
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 15:25:37 PST
Received: by navajo.stanford.edu; Tue, 3 Feb 87 15:24:49 PST
Date: Tue, 3 Feb 87 15:24:49 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Raghu R.
To: jmc@sail.stanford.edu
Can you see him on Friday?
We have 1/2 hr. slots at 11:15, 2, and 3., plus lunch or dinner.
---jdu
∂03-Feb-87 1538 RA Diane Moser
Moser from Space World Magasine called re a story they are doing about
moon settlement. She'll try to call back, or you
can return her call (415) 588 0823.
∂03-Feb-87 1540 PHY
To: "@SEARCH.DIS[1,PHY]"@SAIL.STANFORD.EDU
∂03-Feb-87 1530 DEK the "new" folders that came in to our search committee
(Phyllis, please forward this to the other committee members.)
Gosh, we're getting an incredible number of applicants, many of whom
seem to be very good indeed.
I looked through the seventeen (!) new folders, rather quickly,
and it seems that some of them came to our committee by mistake.
Namely, we should probably send the folders of Banjamin and Koschman
to KSL; and the folders of Dill, Sidwell, Hinrichs to CSL.
I'm not competent to rate the applicants in parallel computation
and/or computational geometry (e.g. Goldman for the latter), so
I can't decide whether to put them into the `first' or `second' set.
Of the other folders, one clearly stands out. Andrew Goldberg
is responsible for the sensational results Tarjan discussed at
last Thursday's AFLB. I talked to Bob afterwards, there's no question
that this new breakthrough in network flow algorithms is entirely
Goldberg's idea (Bob says he only added a few refinements).
Now I see, to my great surprise, that he applied here last year
and actually visited in April; that he is a student at MIT,
not Princeton; that he has reapplied two weeks ago.
I know we already have superb candidates coming in, but it seems
clear that he should be included. Should I "volunteer" to host
him?
∂03-Feb-87 1610 PHY Re:Goldberg
To: "@SEARCH.DIS[1,PHY]"@SAIL.STANFORD.EDU
∂03-Feb-87 1550 SCHAFFER@Sushi.Stanford.EDU Re:Goldberg
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 15:50:38 PST
Date: Tue 3 Feb 87 15:49:51-PST
From: Alejandro Schaffer <SCHAFFER@Sushi.Stanford.EDU>
Subject: Re:Goldberg
To: PHY@Sail.Stanford.EDU
In-Reply-To: Message from "Phyllis Winkler <PHY@SAIL.STANFORD.EDU>" of Tue 3 Feb 87 15:40:00-PST
Message-ID: <12276201672.21.SCHAFFER@Sushi.Stanford.EDU>
I would be delighted to see Goldberg have another chance. Last year when
he came he made a very good impression on me and the other students;
in fact, he made a much better impression than Bob Wilber to whom we
did make an offer. At that time he only had the results on max flow.
Since then he has obtained the results on min-cost flow as well as
some entirely unrelated results in parallel computation with Serge
Plotkin (another student at MIT).
Alex Schaffer
-------
∂03-Feb-87 1620 NILSSON@Score.Stanford.EDU New DEC Project
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 16:19:23 PST
Date: Tue 3 Feb 87 16:14:24-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: New DEC Project
To: ullman@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
cc: nilsson@Score.Stanford.EDU, m.machefsky@Lear.Stanford.EDU
Message-ID: <12276206141.19.NILSSON@Score.Stanford.EDU>
DEC has been supporting the SUNDEC project at Stanford that has
supported research in GSB, at LOTS, and work by David Cheriton here
in CSD. This project is getting ready to wind down, but DEC is
considering a new major series of projects at Stanford---all to
be grouped under the name QUANTUM. I talked with Ira Machevsky
from DEC today about the possibilities for supporting research
of CSD faculty in various areas including AI and "area X." Ira
mentioned that he would like to talk more with each of you to
see if there are areas of mutual interest---research that you might
propose that DEC might support. Sam Fuller is enthusiastic about
extending the DEC support beyond what it has historically dealt
with at Stanford. So, this note is a way of introducing Ira's
interest to you. I suggested that he contact each of you. -Nils
-------
∂03-Feb-87 1620 PAPA@score.stanford.edu New candidates
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 16:16:41 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 3 Feb 87 16:15:08 PST
Date: Tue 3 Feb 87 16:11:00-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: New candidates
To: fndsch@navajo.stanford.edu
Message-Id: <12276205524.37.PAPA@Score.Stanford.EDU>
Another candidate, whose folder is in the mail, is NATARAJAN. He is a student
of Hopcroft, doing work in computational aspects of robotics and AI. He is a
first-year (research) faculty at CMU, and wants for personal reasons to move to
the West Coast. I know his work, and he seems excellent to me.
Goldberg did not finish last year, that's probably why he was not
considered. I have mixed feelings about this extremely technical
work in network algorithms.
---Christos.
-------
-------
-------
∂03-Feb-87 1733 VAL movie
"Stalker", the movie based on a novel by Strugatskie that we wanted to see
once after a trip to Austin, will be shown at 8pm tonight at the Cubberley
Auditorium.
∂03-Feb-87 1822 ILAN@Score.Stanford.EDU Accuracy in Academia
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Feb 87 18:21:43 PST
Date: Tue 3 Feb 87 17:43:24-PST
From: Ilan Vardi <ILAN@Score.Stanford.EDU>
Subject: Accuracy in Academia
To: su-etc@Score.Stanford.EDU
cc: jmc@Sail.Stanford.EDU
Message-ID: <12276222343.11.ILAN@Score.Stanford.EDU>
Maybe Academia is not accurate, but it is precise (in math anyway...).
-------
∂03-Feb-87 2210 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Feb 6, 11:00
Place: 252 Margaret Jacks
Topic: Continued discussion of Qlisp semantics and programming
∂04-Feb-87 0638 coraki!pratt@sun.com Mitchell talk time change
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Feb 87 06:38:03 PST
Received: from Sun.COM ([10.7.0.2]) by navajo.stanford.edu with TCP; Wed, 4 Feb 87 06:36:55 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AB09191; Wed, 4 Feb 87 06:34:42 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA11840; Wed, 4 Feb 87 06:36:26 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA23079; Wed, 4 Feb 87 06:35:00 PST
Date: Wed, 4 Feb 87 06:35:00 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8702041435.AA23079@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell talk time change
It has been suggested that talks are better given earlier. Also Jeff
teaches at 1:15. I'm proposing therefore to move John Mitchell's
talk to 10:00 am.
-v
∂04-Feb-87 0955 RA
Morgan and Kaufmann got your abstract.
∂04-Feb-87 1047 JIMENEZ@Score.Stanford.EDU Robert Smith
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Feb 87 10:47:32 PST
Date: Wed 4 Feb 87 10:42:31-PST
From: Tina Jimenez <JIMENEZ@Score.Stanford.EDU>
Subject: Robert Smith
To: RA@Sail.Stanford.EDU
cc: JMC@Sail.Stanford.EDU
Message-ID: <12276407868.29.JIMENEZ@Score.Stanford.EDU>
Rutie, Prof. McCarthy has chosen Robert Smith to teach CS 309C this
spring quarter, and we are in need of the following information:
1. Robert Smith's resume
2. List of Publications
3. A number to get a hold of him.
Thank you for your Cooperation,
Tina
-------
∂04-Feb-87 1055 RA
John,
Is this the Robert Smith who is to teach CS309C in the Spring quarter?
Smith, Robert Computer Curriculum Corporation, 494-8450.
Thanks,
∂04-Feb-87 1753 HOBBS@SRI-WARBUCKS.ARPA A long story
Received: from SRI-WARBUCKS.ARPA by SAIL.STANFORD.EDU with TCP; 4 Feb 87 17:48:42 PST
Date: Wed 4 Feb 87 16:56:15-PST
From: Jerry Hobbs <HOBBS@SRI-WARBUCKS.ARPA>
Subject: A long story
To: afr: ;
Cc: hobbs@SRI-WARBUCKS.ARPA
Message-ID: <VAX-MM(195)+TOPSLIB(122)+PONY(0) 4-Feb-87 16:56:15.SRI-WARBUCKS.ARPA>
If you want a copy of a 7500-word (42,000-character) account of my trip
to West Africa last summer, answer this message, and I'll ship the file
to you.
-- Jerry
-------
∂05-Feb-87 0835 RA Work schedule
To: BS@SAIL.STANFORD.EDU
CC: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU
Betty,
For the last year and a half I have been leaving early on Thursdays because
I am teaching a class at CCSF. All people involved, John, Zohar, and LaDonna
have agreed to this. The committment to CCSF was based on this understanding.
I would therefore like to continue the present arrangement.
I take this opportunity to let you know that beginning Friday, 2/13, I must
take a two-hour break every second Friday (11:00-1:00) for a medical appointment.
Of the two hours one will be my lunch time and the other will be charged against
my sick leave.
Rutie
------
∂05-Feb-87 0837 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU [<IRA@uwafrodo.bitnet>: AIM Workshop 1987]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Feb 87 08:37:16 PST
Date: Thu 5 Feb 87 08:36:39-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU>
Subject: [<IRA@uwafrodo.bitnet>: AIM Workshop 1987]
To: JMC@SAIL.STANFORD.EDU
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Message-ID: <12276647099.38.AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU>
John,
Below is a proposal for the 1987 AIM workshop for your
review and proposal.
Cheers,
Claudia
---------------
∂05-Feb-87 0924 PERLAKI@Score.Stanford.EDU messages
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Feb 87 09:24:44 PST
Date: Thu 5 Feb 87 09:19:12-PST
From: Agnes M. Perlaki <PERLAKI@Score.Stanford.EDU>
Subject: messages
To: jmc@Sail.Stanford.EDU
Message-ID: <12276654844.32.PERLAKI@Score.Stanford.EDU>
1. Cristine Gray called from the Jet Propulsion Lab. Please call her back
at 818 354-4431. Re: Advisory Committee Meeting. Please note that this
is urgent. (She's been trying to reach you for the last couple of days.)
2. Please call Ellen Grimm at 617 491-2600 for confirming conference date
changes. (From Feb. 12-13-14 to May 7 & 8th.)
-Agi
-------
∂05-Feb-87 0926 BSCOTT@Score.Stanford.EDU Re: Work schedule
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Feb 87 09:26:46 PST
Date: Thu 5 Feb 87 09:21:09-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Re: Work schedule
To: RA@Sail.Stanford.EDU, BS@Sail.Stanford.EDU
cc: JMC@Sail.Stanford.EDU, ZM@Sail.Stanford.EDU, BSCOTT@Score.Stanford.EDU
In-Reply-To: Message from "Rutie Adler <RA@SAIL.STANFORD.EDU>" of Thu 5 Feb 87 08:35:00-PST
Message-ID: <12276655199.26.BSCOTT@Score.Stanford.EDU>
Rutie,
I was not aware that you were leaving early on Thursdays for your teaching,
and LaDonna tells me that she was not aware of this either. Anyway, this
time must be charged either to your personal time off, or to vacation, so
please record it on your time sheets.
The arrangement you suggest for your alternate Friday medical appointment
is satisfactory, but again, please record this on your time sheets.
Betty
-------
∂05-Feb-87 0935 RPG Qlisp meeting tomorrow
To: JMC
CC: LES
Parking around 11am on fridays has become impossible in the pay lots.
I doubt it's reasonable for me to charge parking tickets to the
Qlisp contract. In order for me to get a sticker the parking people
need a letter from CSD stating my appointment dates and that I
need to be there 2 days a week. Jan has asked RA to produce the letter.
I doubt the letter will get to the parking people by tomorrow morning,
so I will try to make the meeting but I won't know whether I'll succeed,
so you should plan on my not being there until this is straightened out.
-rpg-
∂05-Feb-87 1000 JMC
Get Rutie to finish off Industrial lectureship info
∂05-Feb-87 1006 RLG question
the following workshop looks interesting to me, and it is in my
home (D.C.) so I could easily travel there. What is your opinion of it?
Date: Fri, 30 Jan 87 14:28:03 EST
From: Jim Hendler <hendler@brillig.umd.edu>
Subject: Conference - Conceptual Information Processing
[Excerpted from AIList]
Call for Participation
Fourth Annual Workshop
on
Theoretical Issues in Conceptual Information Processing
Washington, D.C.
June 4-5, 1987
Sponsored by
American Association for Artificial Intelligence
and
University of Maryland Institute for
Advanced Computer Studies
Objectives:
The goal of the investigations under the title "conceptual information
processing" has been understanding intelligence and cognition
computationally, rather than merely the construction of performance programs
or formalization per se. Thus, this workshop will focus on an exploration
of issues common to representation and organization of knowledge and memory
for natural language understanding, planning, problem solving, explanation,
learning and other cognitive tasks. The approaches to be covered are united
by a concern with representation, organization and processing of conceptual
knowledge with an emphasis on empirical investigation of these phenomena by
experimentation and implementation of computer programs.
Format:
The TICIP workshop will be comprised of a combination of panels, invited
paper presentations, and "debates" designed to encourage lively and active
discussion. Not all participants will be invited to present, but all will
be expected to interact.
Attendance:
In order to maximize the interactive nature of this workshop, attendance
will be limited. Those interested in participating, either as speakers or
audience, are asked to submit a one-page summary of work in this area. A
small number of invitations will be extended to those who are interested in
the area but have not yet contributed. Those interested in such an
invitation should contact the Program Chair. A limited amount of financial
assistance will be available to graduate students invited to participate.
Review Process:
Invitation will be based on an informal review of submissions by the Program
Committee.
Workshop Information:
The conference chair is Prof. B. Chandrasekaran (Ohio State University). The
program committee consists of Prof.s R. Alterman (Brandeis), J. Carbonell
(CMU), M. Dyer (UCLA), and J. Hendler (U of Maryland, Chair).
Submission:
A one page abstract of recent work in the area should be submitted to the
Program Chair. The deadline for these submissions is April 15, 1987.
Applicants will be informed of their status soon thereafter. Send abstracts
(but please, no papers) to:
James Hendler
Computer Science Department
University of Maryland
College Park, Md. 20742.
hendler@brillig.umd.edu
hendler@maryland
------------------------------
∂05-Feb-87 1022 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
THE SYNTHESIS OF DIRTY LISP PROGRAMS
Richard Waldinger
Artificial Intelligence Center
SRI International
Thursday, February 5, 4pm
Bldg. 160, Room 161K
Most work in program synthesis has focused on the
derivation of applicative programs, which return an
output but produce no side effects. In this talk we
turn to the synthesis of imperative programs, which
may alter data structures and produce other side effects
as part of their intended behavior. We concentrate on
"dirty LISP," an imperative LISP with assignment and
destructive list operations (rplaca and rplacd).
We treat dirty LISP with the same deductive approach
we use for the relatively clean applicative programs.
For this purpose, we introduce a new situational
logic, called "dirty-LISP theory." The talk will
emphasize how to represent instructions and specifications
in this theory.
∂05-Feb-87 1102 ROSENBLOOM@SUMEX-AIM.STANFORD.EDU Re: cs520
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Feb 87 10:58:28 PST
Date: Thu 5 Feb 87 10:57:10-PST
From: Paul Rosenbloom <ROSENBLOOM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: cs520
To: NILSSON@SCORE.STANFORD.EDU
cc: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
WINOGRAD@CSLI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
Buchanan@SUMEX-AIM.STANFORD.EDU, TOB@SAIL.STANFORD.EDU,
Shortliffe@SUMEX-AIM.STANFORD.EDU
Message-ID: <12276672678.15.ROSENBLOOM@SUMEX-AIM.STANFORD.EDU>
Nils: I would prefer for students to receive the wider perspective by
replacing cs223 as the standard graduate-level introductory AI course.
A slightly more rigorous version of cs123 would be appropriate (and
would give them the background that they need for the comprehensive).
It implicitly covers the logicist approach as well as many others in
the process of presenting the key ideas that have been developed in
AI. cs223 seems more appropriate as a second course, in which
students learn to formalize various AI ideas.
I agree with Ed that we are much better off trying to avoid
cross-paradigm arguments. Paradigms are just not at the right level
for the discussion of any of the truly important issues, and because
the arguments tend to be more about philosophy of AI than AI itself,
they tend to just lead to cross-paradigm paranoia and defensiveness.
This said, it is still true that if such an event is going to be held,
I would not want the students to miss seeing the cognitive paradigm,
so I would want to participate. -- Paul
-------
∂05-Feb-87 1130 JMC
Get Rutie to type article.
∂05-Feb-87 1345 LES re: Qlisp meeting tomorrow
To: RPG
CC: JMC
[In reply to message rcvd 05-Feb-87 09:35-PT.]
Sheesh' -- for less than the cost of a sticker you can buy a bicycle and
get here faster and in better health, though occasionally a bit damp.
Les
∂05-Feb-87 1419 RPG
To: LES
CC: JMC
∂05-Feb-87 1345 LES re: Qlisp meeting tomorrow
To: RPG
CC: JMC
[In reply to message rcvd 05-Feb-87 09:35-PT.]
Sheesh' -- for less than the cost of a sticker you can buy a bicycle and
get here faster and in better health, though occasionally a bit damp.
Les
My bike is currently ``down,'' else that's the right thing. Plus,
Jonl is in ill health and must drive for a few more months.
-rpg-
∂05-Feb-87 1901 RIVIN@Score.Stanford.EDU Connection machine access
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Feb 87 18:56:44 PST
Date: Thu 5 Feb 87 18:55:04-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: Connection machine access
To: squires@A.ISI.EDU
cc: rivin@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12276759677.22.RIVIN@Score.Stanford.EDU>
Hi. I am working with John McCarthy et al. on the QLISP project.
I am interested in trying out some (not QLISP related) experiments
on the Connection Machine; John suggested that you could possibly
help with access.
Thanks in advance.
Igor.
-------
∂06-Feb-87 1028 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
OPTIMAL HISTORIES: A TEMPORAL APPROACH TO DEFAULT REASONING
Van Nguyen
IBM T.J.Watson Research Center
Yorktown Heights, NY 10598
Thursday, February 12, 4pm
Bldg. 160, Room 161K
A new technique in default reasoning (non-monotonic reasoning)
is presented. It is based on the notion of optimal histories.
Intuitively, an optimal history contains a sequence of sets S(n),
n = 0, 1, ..., of first-order formulae. Each S(n) is a description of
the state of the world, as seen by some computing agent, at time
(situation) n. State S(n+1) is computed from S(n) and the event
(action) E(n+1) that occurs at time n+1 by a default-inference rule,
so that facts that are true in S(n) tend to stay true in S(n+1), unless
something falsifies them. Other parameters of an optimal history are
the deductive ability of the computing agent and a set of basic axioms
and constraints. Thus an optimal history is a description of how the
world changes with new events, as time passes.
The technique is applicable to such problems in default reasoning as
belief revision, dealing with exceptions to general rules, the frame
problem of McCarthy and Hayes, the qualification problem of McCarthy,
and the temporal projection problem of Hanks and McDermott. Optimal
histories can also be formulated in the framework of temporal logic of
Manna and Pnueli.
∂06-Feb-87 1440 ROBERTS@Sushi.Stanford.EDU Re: SERC probation report!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Feb 87 14:39:14 PST
Date: Fri 6 Feb 87 14:24:00-PST
From: Paul Roberts <ROBERTS@Sushi.Stanford.EDU>
Subject: Re: SERC probation report!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 30 Dec 86 17:17:00-PST
Home address : 870 Bruce Dr, Palo Alto, CA 94303
Phone : (415) 856 1396
Message-ID: <12276972476.19.ROBERTS@Sushi.Stanford.EDU>
Thanks! I passed it along to Nils, he send it back where it belongs.
Paul
-------
∂06-Feb-87 2100 JMC
Write up asking for a ride. Also continue with contexts.
∂07-Feb-87 1005 CLT calendar item
fri 27-feb 20:00 Pocket opera Villa Montalvo (Saratoga)
∂07-Feb-87 1907 VAL re: proposal
[In reply to message rcvd 07-Feb-87 13:47-PT.]
Where can I find "Applications"? FILES[1,JMC] is protected.
∂08-Feb-87 1114 RPG History Question
IBM had a program in the early 1960's that used a vector display
screen and a light pen. You could draw shapes on it and the
program would regularize them when you placed constraints
on parts of them - if you said the three sides of a triangle
were of equal length it would make them equilateral, etc.
They made a film about it that I saw recently. What was the program
called?
-rpg-
∂08-Feb-87 2247 CLT hp28c
here are the articles - one pro, one con
-----------------------------------------------------------------------------
∂09-Jan-87 1047 hearn%rand-unix.arpa@rand-unix.ARPA Algebra Comes to the Calculator Market
Received: from RAND-UNIX.ARPA by SAIL.STANFORD.EDU with TCP; 9 Jan 87 10:47:49 PST
Received: by rand-unix.arpa; Fri, 9 Jan 87 10:29:46 PST
Relay-Version: version B 2.10.2 9/5/84; site randvax.UUCP
Posting-Version: version B 2.10.2 9/5/84; site randvax.UUCP
Path: randvax!hearn
From: hearn@rand-unix.ARPA (Tony Hearn)
Newsgroups: sci.math.symbolic
Subject: Algebra Comes to the Calculator Market
Message-Id: <780@randvax.UUCP>
Date: 9 Jan 87 18:29:42 GMT
Distribution: sci
Organization: Rand Corp., Santa Monica
Lines: 22
Apparently-To: symalg-news-fwd
On January 5, Hewlett-Packard announced the 28C, a calculator which looks
like the 18C (a business calculator released some time ago), but has an
altogether different range of capabilities. It measures roughly 6" by 3
1/2" by 1/2", and has a display measuring about 3" by 1". The display is
bit-mapped, and is point addressable.
The amazing thing about this calculator, apart from its sophisticated
numerical capabilities, is its ability to do some algebra, and some
graphics. I say some algebra, because it is far cry from a REDUCE
machine, or even a PC program like MuMath. However, the integration of
numerics, algebraics, and graphics that this machine demonstrates, has
left me as a algebra system builder feeling quite humble.
I should point out that I do consulting for HP, so that should be taken
into account in assessing my comments. However, I had nothing to do with
this calculator (which came from the HP group in Corvallis, Oregon), apart
from talking occasionally to the people who designed the algebra code.
This list price for this calculator is $235. I suggest you take a look at
this beauty. I'm sure you'll be as fascinated as I am.
Tony Hearn
-----------------------------------------------------------------------------
∂26-Jan-87 0952 RP@MX.LCS.MIT.EDU HP28C-- Algebra Comes to the Calculator Market
Received: from RAND-UNIX.ARPA by SAIL.STANFORD.EDU with TCP; 26 Jan 87 09:51:34 PST
Received: by rand-unix.arpa; Mon, 26 Jan 87 09:25:45 PST
Date: Mon, 26 Jan 87 12:10:40 EST
From: Richard Pavelle <RP%MX.LCS.MIT.EDU@MC.LCS.MIT.EDU>
Subject: HP28C-- Algebra Comes to the Calculator Market
To: symalg-news-fwd@rand-unix.ARPA
Cc: RP%MX.LCS.MIT.EDU@MC.LCS.MIT.EDU
Message-Id: <967113.870126.RP@MX.LCS.MIT.EDU>
From: hearn@rand-unix.ARPA (Tony Hearn)
Subject: Algebra Comes to the Calculator Market
Date: 9 Jan 87 18:29:42 GMT
Apparently-To: symalg-news-fwd
On January 5, Hewlett-Packard announced the 28C, a calculator which looks
like the 18C (a business calculator released some time ago), but has an
altogether different range of capabilities.
...
The amazing thing about this calculator, apart from its sophisticated
numerical capabilities, is its ability to do some algebra, and some
graphics. I say some algebra, because it is far cry from a REDUCE
machine, or even a PC program like MuMath. However, the integration of
numerics, algebraics, and graphics that this machine demonstrates, has
left me as a algebra system builder feeling quite humble.
I tried it recently and am disappointed. It is indeed amazing to be doing
algebra on a hand held machine. But the functionality is so limited, the
machine is so slow and the programming so awkward that I would question
whether anyone will find it useful. For example it takes several minutes,
with user interaction, to expand (x+y)↑4 .
Adding
A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B+A+B
(= 16A+16B) takes several minutes too.
I returned my machine after playing with it for a few hours.
∂09-Feb-87 0453 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Re: visit
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Feb 87 04:53:05 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Mon 9 Feb 87 04:51:26-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Sun 8 Feb 87 22:54:20
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Sun, 8 Feb 87 22:55:46 jst
Date: Sun, 8 Feb 87 22:55:46 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8702081355.AA05659@nttlab.ntt.junet>
To: JMC%SAIL.STANFORD.EDU%sumex-aim@ntt-20
In-Reply-To: John McCarthy's message of 05 Feb 87 2054 PST
Subject: Re: visit
Dear Professor McCarthy,
It is nice that you and Carolyn will be coming to Japan. I and
Professor Ito will welcome you in Sendai.
The number you tried [22 227-6200 x2628] is correct, but I was in
Kyoto for a week and could not answer the phone. You can also try my
home phone which is 22 267-2890. On weekdays I will be in my office
from 10am to 7pm. If you could call my home between 8am and 9:30am
(that is between 3pm and 4:30pm in your time), you would be able to
catch me for sure. I will also try to call you.
** masahiko **
P.S. My best email address is MS@SAIL. (sato@russell works but it is
not so reliable.)
∂09-Feb-87 0547 @wiscvm.wisc.edu:yoav@wisdom.bitnet housing
Received: from WISCVM.WISC.EDU by SAIL.STANFORD.EDU with TCP; 9 Feb 87 05:47:10 PST
Received: from wisdom.bitnet by wiscvm.wisc.edu on 02/09/87 at 07:47:03 CST
From: Yoav Shoham <yoav%WISDOM.BITNET@wiscvm.wisc.edu>
Date: Mon, 9 Feb 87 15:46:25 -0200
To: de2smith@su-ai.arpa, eppley@su-score.arpa, genesereth@su-ai.arpa,
grosof@su-ai.arpa, jmc@su-ai.arpa, nilsson@su-score.arpa,
sjg@su-ai.arpa
Subject: housing
Hello everyone,
I'm looking for a small house or an apartment, furnished, for a few months,
starting at the beginning of April. This will serve until I move into
more permanent quarters. Any leads will be greatly appreciated.
See you all soon.
Yoav
∂09-Feb-87 0606 @VERMITHRAX.SCH.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM Fighting Chance
Received: from [128.81.38.232] by SAIL.STANFORD.EDU with TCP; 9 Feb 87 06:06:16 PST
Received: from RUSSIAN.SPA.Symbolics.COM by VERMITHRAX.SCH.Symbolics.COM via CHAOS with CHAOS-MAIL id 18622; Mon 9-Feb-87 02:12:03 PST
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 15192; Sun 8-Feb-87 02:10:50 PST
Date: Mon, 9 Feb 87 02:12 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: Fighting Chance
To: jmc@SU-AI.ARPA
Message-ID: <870209021258.1.RWG@TSUNAMI.SPA.Symbolics.COM>
I forgot to ask you at Pasand your reaction to that book Beckmann sent us.
Do you think their conclusion that we have no credible deterrent is based
on overestimating Soviet ABM and ASW capability, and understating what
merely 20 subs could do to their industrial base?
∂09-Feb-87 1315 Mailer failed mail returned
To: JMC
In processing the following command:
MAIL
The command was aborted because these Host Name(s) are Unknown:
RUSSIAN.SPA.Symbolics.COM
------- Begin undelivered message: -------
∂09-Feb-87 1315 JMC re: Fighting Chance
[In reply to message sent Mon, 9 Feb 87 02:12 PST.]
I suppose the Soviets find their analysis as uncertain as we find ours.
The confidence Gorbachev has in what military people say about relative
strength could not have been enhanced by what happened to the airplanes
they supplied the Syrians in 1982. I think that the probability of
the Soviets attacking us depends on some sudden and unlikely but
not impossible political change there. I haven't studied the missile
balance, and so have no independent opinion. However, I distrust the
basis of the analysis by scientific peaceniks like Drell.
------- End undelivered message -------
∂09-Feb-87 1341 VAL reply to message
[In reply to message rcvd 08-Feb-87 14:41-PT.]
I've updated arpa87.tex[1,val] as you suggested. As far as the relation to
expert systems is concerned, I am not familiar with that subject at all and
don't really know what to say. If you have any ideas I can try to react to them.
∂10-Feb-87 0843 STEINBERGER@SRI-KL.ARPA Re: Trustees meeting
Received: from SRI-KL.ARPA by SAIL.STANFORD.EDU with TCP; 10 Feb 87 08:43:43 PST
Date: Tue 10 Feb 87 08:40:46-PST
From: Richard Steinberger <STEINBERGER@SRI-KL.ARPA>
Subject: Re: Trustees meeting
To: JMC@SAIL.STANFORD.EDU
cc: su-etc@SCORE.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Feb 87 07:41:00-PST
Message-ID: <12277958567.21.STEINBERGER@SRI-KL.ARPA>
John,
Why does the failure to speak out against every disgusting moral
and/or political action imply that "they regard the practice as OK."
I haven't heard any responsible person of the liberal persuasion applauding
murder in South Africa whether committed by blacks or whites.
When you claim that American supporters of the ANC "must be awarded
some of the moral responsibility for the atrocities they commit," you
are most certainly correct. I wish that the more vocal supporters of this
group would limit their support to the clearly non-violent practices.
There is a double-edged sword at work here; for I could similarily claim
that conservative supporters of the U.S. government and the government that it
helped install in Chile in 1973 must smile upon all the savagery and brutality
of that government. After all, there has benn no official criticism of the
regime. A few months ago, a graduate of my high school (Woodrow Wilson, in
Wash, DC) was set aflame by Chilean police and died from his burns. How many
conservatives condemned this?
Sadly, these are incredibly violent times we live in. There is much
political and social repression and brutality committed by followers of one
"ism" or another. All freedom-loving people should demand that their
governments and leaders act to support more democratic, less totalitarian and
less violent regimes. It is of course not possible for everyone to speak out
against every injust action. Silence should not be interpreted as support.
-Ric Steinberger
steinberger@sri-kl.arpa
-------
∂10-Feb-87 0931 JJW Mail to Symbolics
To: IGS, JMC
"SYMBOLICS" and "SCRC" used to be recognized as nicknames, but they
are no longer valid because there are no "."s in them. They both were
nicknames for SCRC-STONY-BROOK.ARPA, so that name should work for you.
∂10-Feb-87 1028 RICHARDSON@Score.Stanford.EDU Sr. Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 10:28:25 PST
Date: Tue 10 Feb 87 09:27:29-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Sr. Faculty Meeting
To: binford@Whitney.Stanford.EDU, buchanan@SUMEX-AIM.STANFORD.EDU,
feigenbaum@SUMEX-AIM.STANFORD.EDU, rwf@Sail.Stanford.EDU,
golub@Score.Stanford.EDU, guibas@decwrl.dec.com, jlh@Sonoma.Stanford.EDU,
dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU,
ejm@Shasta.Stanford.EDU, papa@Score.Stanford.EDU,
pratt@Navajo.Stanford.EDU, ullman@Score.Stanford.EDU
Message-ID: <12277967073.25.RICHARDSON@Score.Stanford.EDU>
Following the discussions of the Lantz and Mayr cases at the sr. faculty
meeting on Tuesday, Feb. 17 (which begins at 2:30) there will be a
conclusion of discussion of the Winograd case. Please come by my office
and review the file prior to the meeting --- also note that Nils will have
one additional letter which he will present at the meeting.
-Anne
-------
∂10-Feb-87 1458 guibas@decwrl.dec.com it's time for another meeting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 14:53:14 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Tue, 10 Feb 87 14:51:50 PST
Received: from decsrc.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA17085; Tue, 10 Feb 87 14:53:11 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA09791; Tue, 10 Feb 87 14:53:04 PST
Date: Tue, 10 Feb 87 14:53:04 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702102253.AA09791@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: it's time for another meeting
to sift through the uncountable number of new resumes that have arrived in my
absence. there seems to be some gold among the grains of sand, including
(after a relativistic perusal) golberg, goldman, natarajan, and donald.
i propose (again), thursday (2/12), after aflb (i.e., at 1:45 pm in 352).
if there are sufficient conflicts, i'll move the meeting to after
the senior faculty meeting on tuesday, 2/17.
it may be useful if each of you who talked to Cole committed your
impressions into writing. we may start to forget as the weeks pass by.
l.
∂10-Feb-87 1531 HOLDEN@CSLI.Stanford.EDU Re: Trustees meeting
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 15:31:26 PST
Date: Tue 10 Feb 87 10:56:22-PST
From: Gary Holden <HOLDEN@CSLI.Stanford.EDU>
Subject: Re: Trustees meeting
To: JMC@Sail.Stanford.EDU, su-etc@CSLI.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Feb 87 07:41:00-PST
Message-ID: <12277983254.24.HOLDEN@CSLI.Stanford.EDU>
Oppressed people often commit barbaric acts. This is regretable but
understandable, considering the barbaric treatment which they
themselves receive. The moral responsibility for these acts clearly lies
at the door of those who promote and profit by the oppression and
not with those who are trying to eliminate it.
Gary
-------
∂10-Feb-87 1543 RA
indust[1,jmc]
You now have Haley's, Sowa's and Dwork's course descriptions in indust[1,jmc]/8p
∂10-Feb-87 1604 RA
Feb. 4 Inference BOD
Did you take a taxi? If yes, how much was it?
Thanks,
∂10-Feb-87 1608 VAL
Interesting program on tv channel 7
∂10-Feb-87 1725 HSU@Score.Stanford.EDU [Claire Stager <STAGER@Score.Stanford.EDU>: Re: grade change cards]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 17:25:09 PST
Date: Tue 10 Feb 87 14:54:50-PST
From: Yung-Jen Hsu <Hsu@Score.Stanford.EDU>
Subject: [Claire Stager <STAGER@Score.Stanford.EDU>: Re: grade change cards]
To: jmc@Sail.Stanford.EDU
Phone: (415) 856-8499
Office: MJH450 (415) 723-3088
Message-ID: <12278026665.18.HSU@Score.Stanford.EDU>
Prof. McCarthy:
We need to file a grade change for Rick Kunin, a remote TV student of CS306.
His final grade is "A". Since the grade change has to be issued by you
(please see the following message), Please send a message to Claire Stager
(stager@score) to that effect at your convenience. Thank you.
Yung-jen
---------------
Mail-From: STAGER created at 10-Feb-87 08:42:07
Date: Tue 10 Feb 87 08:42:07-PST
From: Claire Stager <STAGER@Score.Stanford.EDU>
Subject: Re: grade change cards
To: Hsu@Score.Stanford.EDU
In-Reply-To: <12277813361.15.HSU@Score.Stanford.EDU>
Office: CS-TAC 29, 723-6094
Message-ID: <12277958813.35.STAGER@Score.Stanford.EDU>
Yung-Jen:
Grade changes are really only supposed to come from the instructor. What you
can do is to send me the grade change information electronically, passing the
message by Prof. McCarthy on the way for his O.K. I can fill out the grade
change cards here, and annotate our records. We try to keep a fairly close
hand on grade change cards, and attempt to keep to our policy of grade changes
always being approved by the instructor.
Let me know if you have any questions about this.
Claire
-------
-------
∂10-Feb-87 1959 GOLUB@Score.Stanford.EDU honors
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 19:59:18 PST
Date: Tue 10 Feb 87 19:52:45-PST
From: Gene H. Golub <GOLUB@Score.Stanford.EDU>
Subject: honors
To: jmc@Sail.Stanford.EDU
Phone: 415/723-3124
Message-ID: <12278080899.19.GOLUB@Score.Stanford.EDU>
Congratulations, John. It's an honor for you and for us.
Gene
---------------
Mail-From: NILSSON created at 10-Feb-87 19:41:08
Date: Tue 10 Feb 87 19:41:08-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: JMC
To: csd-list@Score.Stanford.EDU
Message-ID: <12278078783.14.NILSSON@Score.Stanford.EDU>
I'm very happy to be able to announce that the CSD has doubled its
number of endowed professorships. Today the Stanford Board of Trustees
approved the Charles M. Pigott chair for John McCarthy. Mr. Pigott is
a Seattle industrialist who recently established a professorship in the
School of Engineering. The School and the University enthusiastically
recommended John for this chair. A celebratory event is being planned
for sometime in the near future. Congratulations, John! -Nils
-------
-------
∂10-Feb-87 2258 coraki!pratt@Sun.COM chair
Received: from SUN.COM by SAIL.STANFORD.EDU with TCP; 10 Feb 87 22:52:16 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA01540; Tue, 10 Feb 87 22:49:53 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA03530; Tue, 10 Feb 87 22:52:20 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA04091; Tue, 10 Feb 87 22:52:00 PST
Date: Tue, 10 Feb 87 22:52:00 PST
From: coraki!pratt@Sun.COM (Vaughan Pratt)
Message-Id: <8702110652.AA04091@coraki.uucp>
To: jmc@sail.stanford.edu
Subject: chair
Congratulations!!! That's really great news.
-v
∂10-Feb-87 2315 binford@whitney.stanford.edu congratulations
Received: from WHITNEY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Feb 87 23:15:29 PST
Received: by whitney.stanford.edu; Tue, 10 Feb 87 23:14:35 PST
Date: Tue, 10 Feb 87 23:14:35 PST
From: Tom Binford <binford@whitney.stanford.edu>
To: jmc@sail.stanford.edu
Subject: congratulations
John
Congratulations on the chair.
Regards
Tom
∂11-Feb-87 0902 cheriton@pescadero.stanford.edu Congrats.
Received: from PESCADERO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 09:02:51 PST
Received: by pescadero.stanford.edu with Sendmail; Tue, 10 Feb 87 23:12:31 pst
Date: Tue, 10 Feb 87 23:12:31 pst
From: David Cheriton <cheriton@pescadero.stanford.edu>
Subject: Congrats.
To: jmc@su-ai
on the chair. Long overdue in my opinion.
David C.
∂11-Feb-87 0904 G.GORIN@OTHELLO.STANFORD.EDU Congratulations!
Received: from OTHELLO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 09:04:28 PST
Date: Wed 11 Feb 87 08:59:26-PST
From: Ralph Gorin <G.GORIN@OTHELLO.STANFORD.EDU>
Subject: Congratulations!
To: JMC@SAIL.STANFORD.EDU
Message-ID: <12278224111.107.G.GORIN@OTHELLO.STANFORD.EDU>
Dear John,
I just saw Nils' message that you've been given the Charles M. Pigott
chair. You surely deserve it.
Best regards,
Ralph
-------
∂11-Feb-87 0906 CRISPIN@SUMEX-AIM.STANFORD.EDU congratulations
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 09:06:40 PST
Date: Tue 10 Feb 87 20:22:06-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: congratulations
To: JMC@SAIL.STANFORD.EDU
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12278086243.14.CRISPIN@SUMEX-AIM.STANFORD.EDU>
I would like to offer my congratulations to you for being appointed
to the Charles M. Piggot chair. Your appointment to an endowed
professorship was long overdue.
-- Mark --
-------
∂11-Feb-87 0912 RA Binford file
You already have a Binford file in the PEOPLE section in your filing cabinet.
I put the two letters we have got so far there.
∂11-Feb-87 1000 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Feb 13, 11:00
Place: 252 Margaret Jacks
Topic: Parallelizing symbolic algebra -- Igor will tell us
his current thoughts.
∂11-Feb-87 1015 DEK hearty congratulations
and I hope the chair is real comfortable!
∂11-Feb-87 1119 DAVIES@Sierra.Stanford.EDU Los Alamos visit
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 11:19:43 PST
Date: Wed, 11 Feb 1987 11:20 PST
Message-ID: <DAVIES.12278249728.BABYL@SIERRA.STANFORD.EDU>
From: DAVIES@Sierra.Stanford.EDU
To: JMC@Sail.Stanford.EDU
Subject: Los Alamos visit
cc: Davies@Sierra.Stanford.EDU
Did anyone from Los Alamos actually come to visit? Did anything
interesting come of it?
-- Byron
∂11-Feb-87 1116 RA Sarah's charge to your American Express
Frank from Dina Bolla called and wanted to know whether he has your permission
to charge Sarah's round trip Boston-Lexington, 2/18, $220.50 to your American
Express card. He has to know today since it is an advance-purchase ticket.
Thanks,
∂11-Feb-87 1134 RA lunch time today
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU, BS@SAIL.STANFORD.EDU
Because of a 12:30 appointment, I will take my lunch hour today between 12:20
and 1:20.
Rutie
-----
∂11-Feb-87 1203 AMEHTA@Sushi.Stanford.EDU Subst
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 12:03:13 PST
Date: Wed 11 Feb 87 12:02:11-PST
From: Abhay Mehta <AMEHTA@Sushi.Stanford.EDU>
Subject: Subst
To: jmc@Sail.Stanford.EDU
Message-ID: <12278257379.25.AMEHTA@Sushi.Stanford.EDU>
Here is a short writeup on the Subst that was discussed last meeting. I get
the feeling that you asked me to do something deeper than this so if I missed
the point, please let me know.
Congratulations for the endowed chair award!
Algorithms that have trees as their data structure lend themselves
naturally to parallel computation. Whether or not the parallel computation
pays off depends on the overhead incurred in creating the sub-processes
and on the amount of computation done by each sub-process. The overhead
of creating parallel processes is (almost) independent of the algorithm,
whereas the time taken for each child process to complete is heavily
dependent on the algorithm. Both these factors have to be taken into
account before deciding whether or not to parallelize.
Subst is an example on one extreme end of the spectrum. The job to be done
at each node is a recursive call on Subst on the two sub-trees followed by
a simple cons. To make each recursive call on Subst a separate parallel
process would pay off only if both subtrees were larger than a certain
threshhold size. The threshhold size is dependent only on the overhead
required to create parallel processes.
In the following algorithm we assume that each basic node is made up of
three cells; Car, cdr, and size. Here size(z) = size(car z) + size(cdr z) + 2
(defun subst (x y z)
(cond ((eq y z) x)
((atom z) z)
(t (qlet
(and (> (size (car z)) *threshhold*)
(> (size (cdr z)) *threshhold*))
((q (subst x y (car z)))
(r (subst x y (cdr z))))
(cons q r)))))
-------
∂11-Feb-87 1321 guibas@decwrl.dec.com meeting postponed to Tuesday, 2/17
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 13:21:02 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Wed, 11 Feb 87 13:19:48 PST
Received: from decsrc.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA28009; Wed, 11 Feb 87 13:21:10 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA09943; Wed, 11 Feb 87 13:21:04 PST
Date: Wed, 11 Feb 87 13:21:04 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702112121.AA09943@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: meeting postponed to Tuesday, 2/17
as there were several conflicts. so let's try for tuesday, 2/17, at 4:00
pm, in 352. hopefully the senior fac. meeting will be over by then.
in the meantime please ask phyllis to let you into my office and browse
through some of the resumes that have come in. i have placed the ones i
liked in the first choice folder.
one resume, l. schumacher, i've passed on to gene golub. schumacher is
well-known in approximation theory and has written a book on splines.
(goldman also works on splines, but is closer to graphics).
L.
∂11-Feb-87 1358 GROSOF@Score.Stanford.EDU congratulations!
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 13:57:44 PST
Date: Wed 11 Feb 87 13:46:14-PST
From: Benjamin N. Grosof <GROSOF@Score.Stanford.EDU>
Subject: congratulations!
To: jmc@Sail.Stanford.EDU
Message-ID: <12278276322.48.GROSOF@Score.Stanford.EDU>
Dear John,
Congratulations on the chair!!
Benjamin
-------
∂11-Feb-87 1455 RA not feeling well
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU, BS@SAIL.STANFORD.EDU
I have to leave early because of a bad migraine headache.
Rutie
-----
∂11-Feb-87 1757 GUPTA@Sushi.Stanford.EDU
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Feb 87 17:56:59 PST
Date: Wed 11 Feb 87 17:55:54-PST
From: Anil Gupta <GUPTA@Sushi.Stanford.EDU>
To: jmc@Sail.Stanford.EDU
Message-ID: <12278321772.29.GUPTA@Sushi.Stanford.EDU>
Professor John McCarthy
Dear Professor,
I am a Masters student in the Computer Science Dept and would
like to work as an RA with you.
I have done courses in AI, Logic, Deductive Systems, Cognition
Formal Languages, Data Structures & Algorithms, Concrete Maths, Architecture,
Numerical Analyses etc.
I have also done extensive work in Indian Philosophy viz. the
epistemology, ontology etc. of the Vedas, Upanishads, Yoga-Sutras and other
classic texts.
Could I come over sometime and discuss the above with you ?
Thanks.
Anil Gupta
-------
∂12-Feb-87 0810 STEINBERGER@SRI-KL.ARPA Re: Platoon
Received: from SRI-KL.ARPA by SAIL.STANFORD.EDU with TCP; 12 Feb 87 08:09:52 PST
Date: Thu 12 Feb 87 08:07:59-PST
From: Richard Steinberger <STEINBERGER@SRI-KL.ARPA>
Subject: Re: Platoon
To: JMC@SAIL.STANFORD.EDU
cc: su-etc@SCORE.STANFORD.EDU, comments@SRI-KL.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 11 Feb 87 17:05:00-PST
Message-ID: <12278476888.9.STEINBERGER@SRI-KL.ARPA>
John,
The soldiers were fighting because they were ordered to and because
they wanted to stay alive - reasons soldiers have fought for generations.
My point was that the overall objectives of that conflict were not nearly
so clear as they were for, say US soldiers fighting in Europe or the South
Pacific during WW II.
The film PLATOON claims to be based on one soldier's experience
in Vietnam. I am convinced that Mr. North did not deliberately distort
his Vietnam reality to make a box office success. Movies such as PLATOON
can at best be a map of a larger reality. And I believe that our society
needs to look at such maps from time to time.
I felt that this movie was much fairer and more accurate than the RAMBO,
MISSING IN ACTION, and DEATH BEFORE DISHONOR rubbish that purposefully and
knowlingly distort reality.
As Korzybski (founder of General Semantics) used to say, "The map is not
the territory." The movie does not equal the reality. Does it therefore
have no truth value?
Computer programs often map models of reality into lines of executable
code. The program is not reality either, but if based on an accurate physical
understanding it may still have a good deal of utility and further human
understanding of the natural world (as well as keep sponsors happy).
Programs that distort reality are found in video arcades where we
recognize them for what they are. Movies that distort reality while claiming
to be reality (e.g. RAMBO) do well at the box office. My comments of
yesterday were directed at this situation.
-Ric Steinberger
steinberger@sri-kl.arpa
-------
∂12-Feb-87 0816 STAGER@Score.Stanford.EDU Re: grade change
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Feb 87 08:15:40 PST
Date: Thu 12 Feb 87 08:14:42-PST
From: Claire Stager <STAGER@Score.Stanford.EDU>
Subject: Re: grade change
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Feb 87 17:33:00-PST
Office: CS-TAC 29, 723-6094
Message-ID: <12278478112.17.STAGER@Score.Stanford.EDU>
Thanks for the O.K. on the grade change for Kunin. In order for me to implement
a grade change, however, I'll need the course number, quarter, and full student
name. Another thing that's greatly appreciated, if you can convey it via email,
is why the grade change is being requested. The form I have to fill out for the
Registrar requires an explanation for any grade change, so it makes my job much
simpler if I know the reason you're requesting the change.
Thanks for your help.
Claire
-------
∂12-Feb-87 0909 RA [Reply to message recvd: 11 Feb 87 15:08 Pacific Time]
Your telephone
Re your telephone: Jeanne Jefferies, another specialist,
can come by today to try and figure out how to get things working the way
you want it. Would 2:00 today be ok with you?
Rutie
-----
∂12-Feb-87 1107 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
OPTIMAL HISTORIES: A TEMPORAL APPROACH TO DEFAULT REASONING
Van Nguyen
IBM T.J.Watson Research Center
Yorktown Heights, NY 10598
Thursday, February 12, 4pm
Bldg. 160, Room 161K
A new technique in default reasoning (non-monotonic reasoning)
is presented. It is based on the notion of optimal histories.
Intuitively, an optimal history contains a sequence of sets S(n),
n = 0, 1, ..., of first-order formulae. Each S(n) is a description of
the state of the world, as seen by some computing agent, at time
(situation) n. State S(n+1) is computed from S(n) and the event
(action) E(n+1) that occurs at time n+1 by a default-inference rule,
so that facts that are true in S(n) tend to stay true in S(n+1), unless
something falsifies them. Other parameters of an optimal history are
the deductive ability of the computing agent and a set of basic axioms
and constraints. Thus an optimal history is a description of how the
world changes with new events, as time passes.
The technique is applicable to such problems in default reasoning as
belief revision, dealing with exceptions to general rules, the frame
problem of McCarthy and Hayes, the qualification problem of McCarthy,
and the temporal projection problem of Hanks and McDermott. Optimal
histories can also be formulated in the framework of temporal logic of
Manna and Pnueli.
∂12-Feb-87 1211 RA telephone
Jeanne Jefferies will be here at 3:30.
∂12-Feb-87 1446 RA Frank Dina Bolla
Frank had to change the flight from Anchorage to Osaka because the one
you were scheduled on has no traffic rights, i.e. no passengers allowed unless
they go to Europe.
He scheduled you on 3/28 JAL 418, leav. Anch. 14:50 arr. Tokyo 16:05 (3/29)
connection JAL 424, leave Tokyo 19:00, arr. Osaka 20:50. Business class
confirmed, wait list for coach.
∂12-Feb-87 1650 RDZ@Sushi.Stanford.EDU SCHEMER Paper
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Feb 87 16:50:51 PST
Date: Thu, 12 Feb 1987 16:12 PST
Message-ID: <RDZ.12278565097.BABYL@SUSHI.STANFORD.EDU>
From: Ramin Zabih <RDZ@Sushi.Stanford.EDU>
To: clt@Sail.Stanford.EDU, daniel@Mojave.Stanford.EDU, jmc@Sail.Stanford.EDU,
lamping@Sushi.Stanford.EDU
Cc: RDZ@Sushi.Stanford.EDU
Subject: SCHEMER Paper
In-reply-to: Msg of 18 Jan 1987 23:31-PST from ZABIH
There is a short (4000 word) paper that I just submitted to AAAI which
covers the essence of my Master's thesis, and which I also think is
much more readable. If you would like a copy, just let me know.
Ramin
∂13-Feb-87 0900 JMC
qlisp
∂13-Feb-87 0949 CLT
reminder - dinner tonight at Daniele Nardi's 7pm
∂13-Feb-87 1119 RA medical appointment
To: JMC, ZM
I am leaving now for my Friday medical appointment; will be back by 1:30
∂14-Feb-87 1515 LES re: wrong bboard
[In reply to message rcvd 14-Feb-87 12:26-PT.]
Unfortunately, given that there is still no way to retrieve or move bboard
postings once they have been sent, the "Oops, I made a mistake" message
performs a useful function -- without it, the errant commentator is likely
to receive umpteen grumbles from readers. Thus, it is a useful defensive
measure.
∂14-Feb-87 1905 LES
∂14-Feb-87 1858 JMC re: wrong bboard
[In reply to message rcvd 14-Feb-87 15:15-PT.]
If one makes that kind of mistake, one should tolerantly receive the
umpteen grumbles.
LES - Or we could have an SU-MEA-CULPA bboard.
Actually, I will announce your suggestion, if you like, and listen for
flames and echoes.
∂14-Feb-87 1920 LES "Oops" messages
[In reply to message rcvd 14-Feb-87 19:15-PT.]
Good point. I also have realized that "Oops" messages actually provide no
protection for the culprit -- they are usually seen until *after* the
mis-posting, so a gaggle of grumbles will be received whether or not he
admits guilt publicly.
∂14-Feb-87 2129 GOLDBERG@CSLI.Stanford.EDU Re: South Africa
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Feb 87 21:29:17 PST
Date: Sat 14 Feb 87 21:27:34-PST
From: Jeffrey Goldberg <GOLDBERG@CSLI.Stanford.EDU>
Subject: Re: South Africa
To: JMC@Sail.Stanford.EDU
cc: su-etc@Sail.Stanford.EDU, GOLDBERG@CSLI.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 14 Feb 87 20:47:00-PST
Office-Phone: (415) 723-1616
X-Notice: Mail to goldberg@csli is forwarded to SU-Russell
Message-ID: <12279146737.24.GOLDBERG@CSLI.Stanford.EDU>
JMC writes:
[...] should make their
respective sanctions against South Africa dependent on a sincere
effort on the part of ANC to get rid of necklacing just as
the Reagan Administration has made its support of the Contras
dependent on an effort to get rid of the abuse of civilians.
Any comments?
I agree. Massive funding of the ANC should be contingent on their
behavior. Just as it is supposed to be with the Contras.
Maybe if the ANC get as bad as the Contras we will start shipping them
$100 million (and even more under the table when silly laws like
constitutional procedures don't let the president and the NSC set our
foriegn policy.)
I am rather surprised that JMC would fail to destinguish between
imposing sanctions and supporting (conducting?) an armed rebellion.
-- Jeff Goldberg
-------
∂14-Feb-87 2330 GOLDBERG@CSLI.Stanford.EDU And just how bad are they?
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Feb 87 23:30:26 PST
Date: Sat 14 Feb 87 23:28:24-PST
From: Jeffrey Goldberg <GOLDBERG@CSLI.Stanford.EDU>
Subject: And just how bad are they?
To: JMC@Sail.Stanford.EDU, su-etc@CSLI.Stanford.EDU
Office-Phone: (415) 723-1616
X-Notice: Mail to goldberg@csli is forwarded to SU-Russell
Message-ID: <12279168733.24.GOLDBERG@CSLI.Stanford.EDU>
My apologies for the length of this message. I must also warn the
reader that grusome descriptions of torture and brutality follow. It
is not pleasent at all to read. A Ctrl-O will get you the next
message using MM or TOPS20 BBOARD. Rn users know about n.
JMC has in recent messages said that supports of divestment should
condemn other opponents of the South African Government for their
crimes. Certainly supporters of a particular organization should
speak up about their crimes, but we are not responsible for the action
of those with whom we share enemies. Am I to be tarnished with the
crimes of the Pol Pot regime because I, too, am not a fan of the
Vietnamese government? Of course not.
But let's look at a case which is not analogous to the South Africa
situation. Let's look at a case where we are actively supporting one
particular group. Let's look at the Contras, whose existence as a
viable organization depends on direct US support.
The following material is quoted from the first chapter of "Turning
the tide: the U.S. and Latin America" by Noam Chomsky, 1986, Black
Rose Books, Montreal.
I will put in "[]" reference material that Chomsky has footnoted.
----
... here is a different kind of change, reported by a mother of two
from Estel\'i, near Esmilda Flores's cooperative: [fn Reed Brody,
Contra Terror in Nicaragua (South End, 1985) ...]
Five of them raped me at about five in the evening ... they had
gang-raped me every day. Wehn my vagina coundn't take it anymore,
they raped me through my rectum. I calculate that in 5 days they
raped me 60 times.
The "freedom fighters" dispatched from Washington also beat her
husband and gouged out the eyes of another civilian before killing
him, as she watched
Another witness describes a contra attack on his cooperative in April
1984:
They had already destroyed all that was the cooperative; a coffee
drying machine, the two dormitories for the coffee cutters, the
electricity generators, 7 cows, the plant, the food warehouse.
There was a boy about 15 years old, who was retarded and suffering
from epilepsy. We had left him in a bomb shelter. when we
returned..., we saw...that they had cut his throat, then they cut
open his stomach and left his intestines hanging out on the ground
like a string. They did the same to Juan Corrales who had already
died from a bullet in the fighting. They opened him up and took
out his intestines and cut off his testicles
...
A mother describes how her husband, a lay pastor, and her five
children where kidnapped; when she found therm the next day, "They
were all cut up, their ears were pulled off, thier throats were cut,
their noses and other parts were cut off." An American parish priest
reports that in this region of three towns and scattered mountian
communities, contra attacks have caused "hundreds of deaths and
thousands of displaced people," including many taken to Honduras. A
Miskito teacher kidnapped by the contras describes the tortures to
which he and eitght others were subjected in Honduras, where US
authorities can pretend no ignorance about their agents:
[description of long periods in cold water, ant hills, severe
beatings, injections, and more beating.]
A French priest who trains nurses in the north testified before the
World Court about a handicapped person murdered "for the fun of it,"
of women raped, of a body found with the eyes gouged out and a girl
who had been forced into prostitution at a contra camp in Honduras.
He accused the contras of creatign an atmosphere of terror through
kidnapping, rapes, murder and torture.[fn: Boston Globe, 9-18-85.
The globe devoted 100 words to the priest's report; the Times, none.]
...
Contra political spokesman Arturo Cruz said that "it was `a delicate
thing' to persuade rebel fighters to respect the lives of prisoners
and pro-Sandinista civilians without demoralizing the fighters,"[fn
NYT, 9-15-85 ... ] ...
The foreign press has been less circumspect. There we can read of
"the contras' litany of destruction": the destruction of health and
community centers, cooperatives, kindergartens and school with such
methods as these, described by one the survivors:[fn ... Manchester
Gaurdian Weekly, 11-25-84.]
Rosa had her breasts cut off. Then they cut into her chest and
took out her heart. The men had their arms broken, their testicles
cut off, and their eyes poked out. They were killed by slitting
their throats, and pulling the tongue out through the slit.
And we can learn of a 14-year-old girl who was gang-raped and then
decapitated, her head placed on a stake at the enterance to her
village as a warning to government supporters; of nurses who were
raped, then murdered; a man killed by hanging after his eyes were
gouged out and his fingernails pulled out; a man who was stabbed to
death after having been beaten, his eyes gouged out and a cross carved
in his back after he fleed from a hospital attacked by the contras;
another tortured then skinned; another cut to pieces with bayonets by
the contras who then behaded her 11-month-old baby before his wife's
eyes; others who were raped to a background of religious music;
children shot in the back or repeatadly shot "as though she ahd been
used for target practice," according to a North American priest; along
with much similar testimony provided by American priests, nuns, and
others working in the border areas where the terrorist forces
rampages, attacking from the Honduran bases established by their US
advisers, instructors, and paymasters.[fn ... National times
(Australia) 11-30-84, ... New Statesman (London) 8-31-84.]
--------
See chomsky for full references.
Will JMC be willing to sign a statement that the Contras are
terrorists and by supporting them we are involved in state sponsored
terrorism?
-- Jeff Goldberg
-------
∂15-Feb-87 0204 GOLDBERG@CSLI.Stanford.EDU Re: South Africa
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Feb 87 02:04:09 PST
Date: Sun 15 Feb 87 02:02:17-PST
From: Jeffrey Goldberg <GOLDBERG@CSLI.Stanford.EDU>
Subject: Re: South Africa
To: JMC@Sail.Stanford.EDU
cc: su-etc@CSLI.Stanford.EDU, goldbergmail@CSLI.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 15 Feb 87 01:04:00-PST
Office-Phone: (415) 723-1616
X-Notice: Mail to goldberg@csli is forwarded to SU-Russell
Message-ID: <12279196745.16.GOLDBERG@CSLI.Stanford.EDU>
There are two points I would like to make to JMC.
1) You (JMC) have failed to acknowledge the point of my first message:
sanctions against South Africa and support of the Contras are two very
different things. In the former we take action against a state (which
may and does have other enemies). In the latter we fund a particular
set of enemies of a state.
I suggest that we are not responsible for the crimes of the enemies of
our enemies, but we are responsible for the people we directly
support. If we are going to judge the ANC and the Contras they same
way with respect to the governments they are trying to overthrow then
surely we should be treating them similarly.
2) I have not been known to rush to Noam Chomsky's defense on various
controversial issues, but I do find that I agree with is politics.
But let me concede for the sake of discussion that Chomsky is not
credible as JMC says. I would ask what human rights organizations or
individuals does JMC find credible. Amnesty International? Friends?
the Catholic Church? And what governments? Canada? Mexico?
Australia? Spain? I don't know what these various institutions have
to say about the Contras. But I suspect that JMC will either have to
accept wide spread and continued atrocities by the Contras or only
accept reports from the US State Department and various private
foundations in the US. The contras may have improved a great deal but
it will take a hell of a lot of improvement before they are anything
different from a bunch of brutal thugs.
JMC: If the ANC are not as bad as the contras, should we give them
$100 million. Or conversely, if the contras are no better (and quite
possibly worse) then the ANC, should we cut off serious ties with them
and invest significantly in Nicaragua?
I feel that the antecedent of each of the above questions is true.
JMC disagrees. But, still I would like to hear his answer to what
are to him hypothetical questions.
-- Jeff Goldberg
-------
∂15-Feb-87 0900 JMC
Kitty Rose
∂15-Feb-87 1459 NILSSON@Score.Stanford.EDU cs520
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Feb 87 14:59:47 PST
Date: Sun 15 Feb 87 14:58:38-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: cs520
To: jmc@Sail.Stanford.EDU, val@Sail.Stanford.EDU,
genesereth@SUMEX-AIM.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12279338077.10.NILSSON@Score.Stanford.EDU>
Would any (or all) of you care to give a lecture on the "logicist"
approach? If you all respond yes, I'll try to have you coordinate
a bit so different aspects are covered at least. (I decided to
abandon the "firing line" approach described in a prev msg.)
Invitation to give a guest lecture in a Spring Quarter Seminar Series at
Stanford. Please read over the attached seminar description and let
me know if you would be willing to give a lecture:
CS 520 ARTIFICIAL INTELLIGENCE RESEARCH SEMINAR
APPROACHES TO ARTIFICIAL INTELLIGENCE
Tuesdays 11:00 a.m. Terman Auditorium (Televised over SITN)
Spring Quarter 1987
Convener: Nils Nilsson
The student and/or researcher approaching artificial intelligence will
note that research is guided by a number of different paradigms. Among
the most popular are approaches based on one form or another of symbolic
logic; approaches stressing application-specific data structures and
programs for representing and manipulating knowledge; approaches
involving machine learning; and approaches based on psychological models
of human perception and cognition. There are many variants and
combinations of all of these, and each has contributed to our broad
understanding of how to build intelligent machines. During this seminar
series in 1987 we will invite leading exponents of these paradigms to
describe the main features of his/her approach, what it has achieved so
far, how it differs from other approaches, and what can be expected in
the future.
First Lecture: Tuesday, March 31, 1987
Last Lecture: Tuesday, June 2, 1987
All of the Tuesdays between and including these dates are
more-or-less open. If we can count on you for a lecture, please
tell me what you can about date preferences (a single "must" date;
two or three favorite choices; and/or "impossible" dates). I
would also appreciate at least a working title for your lecture.
Thanks, -Nils
-------
∂15-Feb-87 1624 RESTIVO@Score.Stanford.EDU
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Feb 87 16:24:51 PST
Date: Sun 15 Feb 87 16:23:45-PST
From: Chuck Restivo <Restivo@Score.Stanford.EDU>
To: jmc@Sail.Stanford.EDU
Message-ID: <12279353572.17.RESTIVO@Score.Stanford.EDU>
[cwr]
i need a bit of help. i don't believe it will be possible to justify
spending research money to spot the cost of my account at score. if
my score account goes away i'm worried that it may no longer be
feasible to continue producing Prolog Digest (or supporting the prolog
system). is there any task i might perform in order to support the
case that i'm doing something of value ?
Date: 13 Feb 87 2028 PST
From: Les Earnest <LES@SAIL.STANFORD.EDU>
Subject: SAIL and Score accounts
[In reply to message sent Fri 13 Feb 87 14:37:43-PST.]
I regret to say that it will not be possible to continue any of your
accounts without finding someone here who either is willing to pay the
bill out of research funds or who is willing to make the case that you
are doing something valuable for CSD.
-------
∂15-Feb-87 1823 RESTIVO@Score.Stanford.EDU re: SAIL and Score accounts
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Feb 87 18:23:10 PST
Date: Sun 15 Feb 87 18:22:07-PST
From: Chuck Restivo <Restivo@Score.Stanford.EDU>
Subject: re: SAIL and Score accounts
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 15 Feb 87 18:16:00-PST
Message-ID: <12279375120.17.RESTIVO@Score.Stanford.EDU>
[cwr]
Thank you.
-------
∂15-Feb-87 2259 LES re: SAIL and Score accounts
[In reply to message rcvd 15-Feb-87 18:16-PT.]
Inasmuch as CSD-CF is in the computer services business but not in the
community service business, the appropriate entity for providing computer
support for Restivo, other than a sponsored project, would be CSD.
Therefore if Jeff Ullman declines (Chuck asked him too), I will plan
to invite Nils to decide.
∂15-Feb-87 2313 LES re: Community service
[In reply to message rcvd 15-Feb-87 23:00-PT.]
There is a significant difference between the local bboard community,
which pays for computer time both to post and read bboard messages,
and the Prolog Newsletter community, which is largely external.
I am currently offering CSD-CF overhead accounts only to people who
maintain useful software for CSD-CF machines.
If Nils agrees that that the Prolog Newsletter is a useful CS community
service, then an account could be provided on Sushi, which is not a cost
center.
∂16-Feb-87 1301 HSU@Sushi.Stanford.EDU infomation
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Feb 87 13:01:40 PST
Date: Mon 16 Feb 87 13:00:23-PST
From: Yung-Jen Hsu <Hsu@Sushi.Stanford.EDU>
Subject: infomation
To: jmc@Sail.Stanford.EDU
Phone: (415) 856-8499
Office: MJH450 (415) 723-3088
Message-ID: <12279578694.22.HSU@Sushi.Stanford.EDU>
Prof. McCarthy:
I was pointed to some work done by Chris Gold on compilation of visual data,
but I couldn't find the reference to paper/report written about it. Could
you give me some help on that? Thanks.
Yung-jen
-------
∂16-Feb-87 1306 HSU@Sushi.Stanford.EDU re: infomation
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Feb 87 13:06:39 PST
Date: Mon 16 Feb 87 13:05:22-PST
From: Yung-Jen Hsu <Hsu@Sushi.Stanford.EDU>
Subject: re: infomation
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Feb 87 13:05:00-PST
Phone: (415) 856-8499
Office: MJH450 (415) 723-3088
Message-ID: <12279579602.22.HSU@Sushi.Stanford.EDU>
Thanks. I'll try to contact him.
-------
∂16-Feb-87 1601 mogul@decwrl.DEC.COM Necklacing
Received: from [128.45.0.240] by SAIL.STANFORD.EDU with TCP; 16 Feb 87 16:01:50 PST
Received: from acetes.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA26870; Mon, 16 Feb 87 16:02:26 PST
Received: by acetes.dec.com (4.22.05/4.7.34)
id AA03256; Mon, 16 Feb 87 16:02:18 pst
Date: Mon, 16 Feb 87 16:02:18 pst
From: mogul@decwrl.DEC.COM (Jeffrey Mogul)
Message-Id: <8702170002.AA03256@acetes.dec.com>
To: jmc@sail.stanford.edu
Subject: Necklacing
Are you saying that you would support sanctions against South
Africa if the ANC were to condemn necklacing and (in some reasonably
verifiable way) not practice it?
Also, I genuinely do not know if the ANC itself is accused of taking
part in necklacing, although I do know that they refuse to condemn
it. Do you have any evidence either way (of course, I reserve the
right to make up my own mind about the credibility of anything I read.)
Thanks
-Jeff
∂16-Feb-87 1721 guibas@decwrl.dec.com reminder: meeting tomorrow at 4:00 in mjh 352
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Feb 87 17:21:05 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Mon, 16 Feb 87 17:19:39 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA27565; Mon, 16 Feb 87 17:21:11 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA15797; Mon, 16 Feb 87 17:21:03 PST
Date: Mon, 16 Feb 87 17:21:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702170121.AA15797@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: reminder: meeting tomorrow at 4:00 in mjh 352
∂16-Feb-87 1940 GOLDBERG@CSLI.Stanford.EDU mail
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Feb 87 19:40:37 PST
Date: Mon 16 Feb 87 19:38:13-PST
From: Jeffrey Goldberg <GOLDBERG@CSLI.Stanford.EDU>
Subject: mail
To: jmc@Sail.Stanford.EDU
Office-Phone: (415) 723-1616
X-Notice: Mail to goldberg@csli is forwarded to SU-Russell
Message-ID: <12279651117.13.GOLDBERG@CSLI.Stanford.EDU>
I sent two short notes to you saying that a longer response would be
forthcoming. This two notes seem to be stuck in SU-Russell's mail queue.
I would appreciate being cc'ed on bboard messages that are replies to my
postings. And thank you for asking. I gather that you don't want to be
cc'ed on such messages. And I will try to remember to refrain from doing
so.
-Jeff Goldberg
-------
∂16-Feb-87 1951 CLT soup
i took out some, so modulo leaving some for Hazel, eat what you want
∂17-Feb-87 0831 RICHARDSON@SCORE.STANFORD.EDU Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 08:31:25 PST
Date: Tue 17 Feb 87 08:08:40-PST
From: Anne Richardson <RICHARDSON@SCORE.STANFORD.EDU>
Subject: Faculty Meeting
To: binford@Whitney.Stanford.EDU, buchanan@SUMEX-AIM.Stanford.EDU,
feigenbaum@SUMEX-AIM.Stanford.EDU, rwf@SAIL.STANFORD.EDU,
golub@SCORE.STANFORD.EDU, guibas@decwrl.dec.com, jlh@SONOMA.STANFORD.EDU,
dek@SAIL.STANFORD.EDU, zm@SAIL.STANFORD.EDU, jmc@SAIL.STANFORD.EDU,
ejm@SHASTA.STANFORD.EDU, papa@SCORE.STANFORD.EDU,
pratt@Navajo.Stanford.EDU, ullman@SCORE.STANFORD.EDU
Message-ID: <12279787731.10.RICHARDSON@SCORE.STANFORD.EDU>
Reminder: After discussion of the Lantz and Mayr cases today (Tues., Feb. 17)
which begins at 2:30 in MJH 252, there will be discussion of the Winograd case.
If you have not stopped by my office yet to look at the file, please do so.
-------
∂17-Feb-87 1104 NILSSON@Score.Stanford.EDU winograd letter
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 11:04:20 PST
Date: Tue 17 Feb 87 11:02:34-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: winograd letter
To: binford@Whitney.Stanford.EDU, buchanan@SUMEX-AIM.Stanford.EDU,
feigenbaum@SUMEX-AIM.Stanford.EDU, floyd@Score.Stanford.EDU,
golub@Score.Stanford.EDU, guibas@Score.Stanford.EDU,
jlh@Sonoma.Stanford.EDU, dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU,
jmc@Sail.Stanford.EDU, papa@Score.Stanford.EDU, pratt@Score.Stanford.EDU,
ullman@Score.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12279819389.46.NILSSON@Score.Stanford.EDU>
Flash: I've just rcvd a letter from Hubert Dreyfus regarding Terry's
promotion. It is positive. I'll bring copies of it to our fac mtg
this pm, and Anne has copies in my office for those who want to stop
by and read it ahead of time. -Nils
-------
∂17-Feb-87 1125 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU [The Mailer Daemon <Mailer@SUMEX-AIM.STANFORD.EDU>: Message of 11-Feb-87 10:55:41]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 11:25:17 PST
Date: Sun 15 Feb 87 12:22:45-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: [The Mailer Daemon <Mailer@SUMEX-AIM.STANFORD.EDU>: Message of 11-Feb-87 10:55:41]
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12279309700.13.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Date: Sat 14 Feb 87 11:09:59-PST
From: The Mailer Daemon <Mailer@SUMEX-AIM.STANFORD.EDU>
To: FEIGENBAUM@SUMEX-AIM.STANFORD.EDU
Subject: Message of 11-Feb-87 10:55:41
Message undeliverable and dequeued after 3 days:
jmc@SAIL.STANFORD.EDU.#Internet: Cannot connect to host
------------
Date: Wed 11 Feb 87 10:55:40-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: congratulations and MORE
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12278245270.81.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Dear John,
Writing a note of congratulations to you on your
new Chair gives me the opportunity to say more.
I came by your office after the faculty lunch yesterday but
didn't find you in. So I'll do it by e-mail.
First, on the Chair. This is long overdue. When I was chairman, I lobbied hard
to get an endowed chair for you, and was not persuasive enough
with the management of the H&S School to get the
professorship gifts pointed toward CS. With Gibbons and the School of
Engineering it is a different story. I must say that it was not only
a question of getting another chair for CS but specifically getting
a Chair for YOU. Anyway, congratulations!!!!!!!!
There is another HONOR coming your way soon. I took the initiative on
this several months ago, and it is reaching fruition, but I am
bound by the "rules of the game" not to reveal this thing early.
But stay tuned...some very good honorific news is coming soon.
I'm really proud to be a Stanford AI colleague of yours, and have been
all these years.
Best wishes,
Ed
-------
-------
-------
∂17-Feb-87 1130 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab email addresses
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 11:30:40 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Mon 16 Feb 87 07:04:22-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Mon 16 Feb 87 22:51:01
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Mon, 16 Feb 87 22:52:58 jst
Date: Mon, 16 Feb 87 22:52:58 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8702161352.AA06951@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20,
clt%sail.stanford.edu%sumex-aim@ntt-20
Subject: email addresses
Dear John and Carolyn,
Here is a list of addresses you requested.
Susumu Hayashi
hayashi%kurims.kyoto-u.junet%utokyo-relay@relay.cs.net
Takafumi Sakurai
a87480%tansei.u-tokyo.junet%utokyo-relay@relay.cs.net
Hayao Nakahara
a32275%tansei.u-tokyo.junet%utokyo-relay@relay.cs.net
I am now contacting Arima at ICOT and Nakagawa at Yokohama National
University who are interested in common sense reasoning.
** masahiko **
∂17-Feb-87 1300 RIVIN@Score.Stanford.EDU the squires connection
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 13:00:08 PST
Date: Tue 17 Feb 87 12:59:03-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: the squires connection
To: jmc@Sail.Stanford.EDU
cc: rivin@Score.Stanford.EDU
Message-ID: <12279840594.37.RIVIN@Score.Stanford.EDU>
Squires seems to have ignored that message I sent to him re Connection
Machine access. Is there any way to go from here?
TNX
Igor.
-------
∂17-Feb-87 1310 RA Haley
Haley just gave me his one-sentence bio over the phone and I added it to
indust[1,jmc].
∂17-Feb-87 1447 BERG@Score.Stanford.EDU 1987/88 schedule
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 14:46:58 PST
Date: Tue 17 Feb 87 14:34:44-PST
From: Kathy Berg <BERG@Score.Stanford.EDU>
Subject: 1987/88 schedule
To: jmc@Sail.Stanford.EDU
Stanford-Phone: (415) 723-4776
Message-ID: <12279858015.17.BERG@Score.Stanford.EDU>
John:
I plan to submit our corrected copy for the next edition
of Courses and Degrees next week. I still need some information
from you.
1. You had mentioned at the AI faculty meeting (1/16) that
you might be willing to teach CS 101 (Computers: Their Nature
and Impact) winter quarter. Have you yet decided? If you
do agree to teach the course, I will check with VTSS about a
crosslisting.
2. Do you have any firm information about the Industrial
Lectureship series?
My thanks for your kind attention.
Kathryn Berg
-------
∂17-Feb-87 1731 BRINK@Sushi.Stanford.EDU Term Papers
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 17:31:02 PST
Date: Tue 17 Feb 87 17:29:44-PST
From: Ed Brink <brink@Sushi.Stanford.EDU>
Subject: Term Papers
To: jmc@Sail.Stanford.EDU
cc: val@Sail.Stanford.EDU
Message-ID: <12279889871.22.BRINK@Sushi.Stanford.EDU>
It would be a great help to me, and probably to many in CS326, if you could
indicate next time some parameters for term papers, in particular the sort of
topic that would be appropriately hard, and roughly the amount of work a paper
should represent (or the amount of news it should contain).
Time is getting short, at least for me; I have up to three such papers I could
accuse myself of owing, although 326 is the only class in which a final is not
an alternative to a term paper, I think.
It had occurred to me that one could write a paper which would serve for more
than one of 326, 356 (Halpern on modal logics, esp. Kripke structures, know-
ledge and belief w.r.t. distributed systems) and 276 (Winograd on computational
semantics). Do you have any feeling on that idea, I mean whether it would be
allowable from your point of view, not what the topic should be?
Thanks..
..Ed
-------
∂17-Feb-87 1838 guibas@decwrl.dec.com action items, meeting of 2/17
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Feb 87 18:38:18 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Tue, 17 Feb 87 18:36:48 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA10496; Tue, 17 Feb 87 18:38:18 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA03650; Tue, 17 Feb 87 18:38:06 PST
Date: Tue, 17 Feb 87 18:38:06 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702180238.AA03650@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: action items, meeting of 2/17
Guibas will host Suri
Papadimitriou will host Natarajan
Ullman will host Goldberg
we will exlore possible interest for Goldman in CSL or ME.
∂18-Feb-87 0107 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
LOCALITY IN NON-MONOTONIC THEORIES
Benjamin Grosof
Thursday, February 19, 4pm
Bldg. 160, Room 161K
We define a new non-monotonic logical formalism that combines what we
argue to be the advantages of several previous ones. It directly
expresses both default beliefs, e.g. ``believe a bird flies,
unless you have information to the contrary'', and preferences, a.k.a.
Priorities, among default beliefs, e.g. ``Believe that ostriches
do not fly, more strongly than you believe birds do fly''. It has a
strong semantics based on first- and second- order logic, and
maintains a unique theory, unlike some non-monotonic formalisms that
often split into a large number of multiple extensions. It treats
defaults and priorities (and also ``fixture'' axioms) on a uniform
footing with ordinary, non-retractible, axioms, so that, for example,
it is well-defined to derive them. The new formalism is most closely
related to circumscription.
Except about inheritance networks, previous work has mainly treated
non-monotonic theories as monoliths without much internal structure.
We argue that locality is crucial in dealing with the central
difficulty: context-dependence, and conflicting interactions, among
beliefs. We define modular DECOMPOSITIONS of (non-monotonic) theories,
hierarchically, into sub-theories. The essential idea is to summarize
the relevant external context of a MODULE (a set of axioms, including
defaults), via imported and exported ``declarations'', in a manner
analogous to programming languages. We then discuss reformulating and
updating non-monotonic theories. We focus on PARTIAL
monotonicities. We suggest the advantages of partial monotonicities,
decompositions, and reformulations: 1) for structuring specifications,
e.g. knowledge engineering in large knowledge bases; 2) for designing
new inference algorithms; and 3) for improving the efficiency of
inference. All of this bears on a wide variety of
applications of non-monotonic theories.
∂18-Feb-87 0400 goldberg@russell.stanford.edu Re: Agreeing with Chomsky's politics
Received: from RUSSELL.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 04:00:10 PST
Received: by russell.stanford.edu with Sendmail; Mon, 16 Feb 87 15:36:50 pst
Date: 16 Feb 1987 1536-PST (Monday)
From: Jeffrey.Goldberg@russell.stanford.edu, <goldberg@russell.stanford.edu>
To: JMC@SAIL.STANFORD.EDU
Cc: goldbergmail@csli
Subject: Re: Agreeing with Chomsky's politics
In-Reply-To: John McCarthy <JMC@SAIL.STANFORD.EDU> /
15 Feb 87 2310 PST.
I do believe that Israel should exist. But I do oppose some of its
foreign policies and its policies in the occupied territories.
Some might argue that Israel's existence depends on these policies.
I disagree. If I did agree then I don't really know what I would
have to say about Israel's right to exist.
I will answer your other posting at some later point. I need to
spend some time running errands and doing work.
I would like to say that when I posed my question to you, I was
aware of the fact that I was not forcing a contradiction. I did
realize that one could defend current policy if one believed that
the Sandinista government is more pernicious than the South African
government.
As you said this depends on what we consider our national interest.
I believe that there a long term pragmatic reasons why we should
actually try "constructive engagement" with the Sandinista's and
with the ANC instead of with their enemies.
-- Jeff Goldberg
∂18-Feb-87 0400 goldberg@russell.stanford.edu Re: su-etc
Received: from RUSSELL.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 04:00:22 PST
Received: by russell.stanford.edu with Sendmail; Mon, 16 Feb 87 14:51:31 pst
Date: 16 Feb 1987 1451-PST (Monday)
From: Jeffrey.Goldberg@russell.stanford.edu, <goldberg@russell.stanford.edu>
To: JMC@SAIL.STANFORD.EDU
Cc: goldberg@russell.stanford.edu
Subject: Re: su-etc
In-Reply-To: John McCarthy <JMC@SAIL.STANFORD.EDU> /
15 Feb 87 1134 PST.
I do prefer to be Cc'ed on messages sent to su-*. I see from your
message that it is not necessary that send copies to you.
thank you for tthe consideration.
-- Jeff Goldberg
∂18-Feb-87 1047 MAYR@score.stanford.edu Joel Friedman's schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 10:46:59 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 18 Feb 87 10:45:18 PST
Date: Wed 18 Feb 87 10:43:15-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Joel Friedman's schedule
To: fndsch@navajo.stanford.edu
Message-Id: <12280078016.55.MAYR@Score.Stanford.EDU>
Who: Joel Friedman, UC Berkeley
What: "On the Convergence of Newton's Method"
When: Thursday, Feb. 19, 12:30pm
Where: MJH352
Abstract: see message to AFLB
Schedule for Joel Friedman:
10:00-10:30 Mayr
10:30-11:00 Ullman
11:00-12:00 Guibas
12:00-12:30 lunch (fast food)
12:30- 1:30 talk (AFLB)
1:30- 2:00 Knuth
2:00- 2:30 Nilsson
2:30- 3:00
3:00- 3:30 students MJH352
3:30- 4:00 students
4:00- 4:30 Oliger
4:30- 5:00 Pratt
-------
∂18-Feb-87 1053 guibas@decwrl.dec.com Suri
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 10:53:51 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Wed, 18 Feb 87 10:52:26 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA17873; Wed, 18 Feb 87 10:16:08 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA01011; Wed, 18 Feb 87 10:16:03 PST
Date: Wed, 18 Feb 87 10:16:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702181816.AA01011@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: Suri
I have arranged for Subhash to visit Th. March 5 (he can also be here part
of March 6).
l.
∂18-Feb-87 1252 PAPA@score.stanford.edu Natarajan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 12:52:43 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 18 Feb 87 12:51:08 PST
Date: Wed 18 Feb 87 12:50:14-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Natarajan
To: fndsch@navajo.stanford.edu
Message-Id: <12280101135.30.PAPA@Score.Stanford.EDU>
Natarajan is going to visit Thursday the 12th of March.
---Christos.
-------
∂18-Feb-87 1351 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Feb 20, 11:00
Place: 252 Margaret Jacks
Topic: Various possibilities -
The subst problem
Parallelizing arithmetic - bignum routines
Getting started on a Qlisp Manual
Suggestions? requests?
∂18-Feb-87 1357 SCHAFFER@sushi.stanford.edu Summary of Visits
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 13:57:12 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 18 Feb 87 13:55:50 PST
Date: Wed 18 Feb 87 13:55:24-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Summary of Visits
To: fndsch@navajo.stanford.edu
Message-Id: <12280112996.33.SCHAFFER@Sushi.Stanford.EDU>
Candidate Host Date(s)
Cole Mayr 9 February
Friedman Mayr 19 February
Sleator Knuth 26 February (possibly 27 as well)
Suri Guibas 5 March (possibly 6 as well)
Mitchell Pratt 10 March
Natarajan Papadimitriou 12 March
Goldberg Ullman to be arranged
AAS
-------
∂18-Feb-87 1415 RA don't feel well
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU, BS@SAIL.STANFORD.EDU
I don't feel well and will be going home shortly.
Rutie
----
∂18-Feb-87 1515 VAL re: proposal
[In reply to message rcvd 16-Feb-87 17:31-PT.]
I have added some material from the old draft to your new piece and included
a semi-formalized ship-moving example. See darpa.2[1,val].
∂18-Feb-87 2316 coraki!pratt@sun.com Mitchell schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Feb 87 23:16:20 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Wed, 18 Feb 87 23:14:45 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA02610; Wed, 18 Feb 87 23:11:13 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA03850; Wed, 18 Feb 87 23:16:02 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA08091; Wed, 18 Feb 87 23:16:20 PST
Date: Wed, 18 Feb 87 23:16:20 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8702190716.AA08091@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell schedule
Here is the schedule for John Mitchell on March 10, to date. Please
let me know when you'd like to talk with him if you haven't yet done so.
Company for lunch and dinner would be more than welcome.
-v
∂19-Feb-87 0611 @wiscvm.wisc.edu:dwork@ALMVMA.BITNET
Received: from WISCVM.WISC.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 06:11:27 PST
Received: from WISCVM.BITNET by wiscvm.wisc.edu on 02/19/87 at 08:11:07 CST
Date:Wed 18 February 1987
From: dwork%almvma.bitnet@wiscvm.arpa
To:jmc@su-ai
Prof. McCarthy:
Rutie Andler has requested (and received) from me a course title
and description for inclusion in the course catalog. One question:
am I the Visiting Industrial Professor for next year?
Cynthia Dwork
∂19-Feb-87 0914 CHIU@Sushi.Stanford.EDU re: ROC
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 09:14:05 PST
Date: Thu 19 Feb 87 09:12:35-PST
From: Chan Chiu <CHIU@Sushi.Stanford.EDU>
Subject: re: ROC
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 18 Feb 87 20:55:00-PST
Message-ID: <12280323655.16.CHIU@Sushi.Stanford.EDU>
I believe that Russians pulled out either in 1948 or 1949.
Mao took over mainland in 1949. At any rate, all the
ammunition Russians got from surrendered Japanese troops were turned over
to Mao ! I agree with you that Stalin didn't completely trust Mao. However,
I believe it was Stalin's best interest to have a communism
government in China than to have KMT.
As it turned out lated, Mao was all over Russians side.
That broke most western contrys' illusion about Mao. Before
then, Mao was perceived by western contrys as farm reformer.
Of course, with Russia, China , east europe and north Korea in on camp,
it was very easy for the free world to actually visualize the possibility
of a global communism take over.
There began the cold war.
/Chan Chiu
-------
∂19-Feb-87 0915 RICHARDSON@Score.Stanford.EDU Binford
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 09:15:11 PST
Date: Thu 19 Feb 87 09:13:05-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Binford
To: jmc@Sail.Stanford.EDU
cc: ra@Sail.Stanford.EDU
Message-ID: <12280323746.13.RICHARDSON@Score.Stanford.EDU>
Can you let me know the status on the Binford reappointment? In order to
comply with SOE's schedule, we should get preliminary papers to them by
March 4.
-Anne
-------
∂19-Feb-87 0945 PHY@sail.stanford.edu
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 09:44:55 PST
Received: from Sail.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 19 Feb 87 09:43:36 PST
Date: 19 Feb 87 0944 PST
From: Phyllis Winkler <PHY@sail.stanford.edu>
To: fndsch@navajo.stanford.edu
Danny Sleator will be visiting here on Thursday, February 26. Please
sign up to visit with him.
Danny Sleator schedule
Who: Danny Sleator, Carnegie Mellon University
What: AFLB talk ``Competitive Algorithms for On-Line Problems''
When: Thursday, February 26
Where: MJH 352
9:00- 9:30
9:30-10:00
10:00-10:30
10:30-11:00
11:00-11:30
11:30-12:00 Nils Nilsson MJH 216
12:00-12:30
12:30- 1:30 AFLB talk MJH 352
1:30- 2:00
2:00- 2:30
2:30- 3:00
3:00- 3:30
3:30- 4:15 Students MJH 301
4:15- 5:00
∂19-Feb-87 1015 ULLMAN@score.stanford.edu [avg@NEWTOWNE-VARIETY.LCS.MIT.EDU (Andrew V. Goldberg): Re: Another Stanford visit?]
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 10:15:18 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 19 Feb 87 10:13:51 PST
Date: Thu 19 Feb 87 10:12:55-PST
From: Jeffrey D. Ullman <ULLMAN@score.stanford.edu>
Subject: [avg@NEWTOWNE-VARIETY.LCS.MIT.EDU (Andrew V. Goldberg): Re: Another Stanford visit?]
To: fndsch@navajo.stanford.edu
Message-Id: <12280334639.40.ULLMAN@Score.Stanford.EDU>
Return-Path: <avg@NEWTOWNE-VARIETY.LCS.MIT.EDU>
Received: from NEWTOWNE-VARIETY.LCS.MIT.EDU by SCORE.STANFORD.EDU with TCP; Thu 19 Feb 87 09:10:42-PST
Received: by NEWTOWNE-VARIETY.LCS.MIT.EDU (4.12/4.7); Thu, 19 Feb 87 12:10:31 est
Date: Thu, 19 Feb 87 12:10:31 est
From: avg@NEWTOWNE-VARIETY.LCS.MIT.EDU (Andrew V. Goldberg)
Message-Id: <8702191710.AA14702@NEWTOWNE-VARIETY.LCS.MIT.EDU>
To: ULLMAN@score.stanford.edu, goldberg@ucbvax.Berkeley.EDU
Subject: Re: Another Stanford visit?
I am very interested in a position in your department and I'll be
happy to visit Stanford again. I am now working out the details
of my trip to the Bay Area, and I will know the details in the
beginning of the next week. I will arrange my visit on one of the
following dates: March 4, 9, 11, or 13. Please let me know
if some of these dates become unavalable.
I will contact you early next week regarding the exact date of my
visit. If you need any additional inflomation about my publications
or educational background, please let me know.
-- Andrew Goldberg
-------
∂19-Feb-87 1018 MAYR@score.stanford.edu Joel Friedman visit today cancelled
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 10:18:32 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 19 Feb 87 10:16:58 PST
Date: Thu 19 Feb 87 10:16:26-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Joel Friedman visit today cancelled
To: fndsch@navajo.stanford.edu, oliger@navajo.stanford.edu
Message-Id: <12280335279.9.MAYR@Score.Stanford.EDU>
Joel came down with a stomach flue, so he can't be here today. I'll try
to set up some other date for him to visit asap.
-ernst
-------
∂19-Feb-87 1034 coraki!pratt@sun.com Mitchell schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 10:34:15 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Thu, 19 Feb 87 10:32:17 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA10148; Thu, 19 Feb 87 10:28:45 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA12965; Thu, 19 Feb 87 10:33:33 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA09330; Thu, 19 Feb 87 10:33:29 PST
Date: Thu, 19 Feb 87 10:33:29 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8702191833.AA09330@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell schedule
Here's the promised schedule for Mitchell which I neglected to include
in my previous message.
10-11 talk
11:00-11:30
11:30-12:00 Ullman
12-1:15 lunch
1:30-2:00 Mayr
2:00-2:30
2:30-3:15
3:15-3:45 Knuth
3:45-4:45 students
4:00-4:30
4:30-5:00
5:00-5:30
6:00 dinner
∂19-Feb-87 1109 MAYR@score.stanford.edu rescheduling J. Friedman's visit
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 11:09:16 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 19 Feb 87 11:07:58 PST
Date: Thu 19 Feb 87 11:07:15-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: rescheduling J. Friedman's visit
To: fndsch@navajo.stanford.edu
Message-Id: <12280344531.9.MAYR@Score.Stanford.EDU>
Well, Joel Friedman couldn't make it today since he fell sick. I am trying
to reschedule his visit. Of course, some weeks are already getting crowded.
How do people feel about Wednesday, March 4?
Who: Joel Friedman, UC Berkeley
What: "On the Convergence of Newton's Method"
When: Wednesday, March 4, at 2:15pm
Where: MJH352
Why: It's a wonderful talk, and he is applying here for a faculty position.
Still true.
Please fill in the line below appropriate for you, and mail this message
back to me.
Schedule for Joel Friedman:
9:00- 9:30 Mayr MJH334
9:30-10:00
10:00-11:00 Guibas
11:00-12:00
12:00-12:30
12:30- 1:30
1:30- 2:00 Nilsson
2:00- 3:30 talk
3:30- 4:00
4:00- 4:30
4:30- 5:00
-ernst
-------
∂19-Feb-87 1215 RA bag
To ship the bag by Federal Express will cost $57.50 (it weighs 19lb.) is it
ok with you?
Thanks,
∂19-Feb-87 1249 PHY@sail.stanford.edu
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 12:49:14 PST
Received: from Sail.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 19 Feb 87 12:47:55 PST
Date: 19 Feb 87 1248 PST
From: Phyllis Winkler <PHY@sail.stanford.edu>
To: fndsch@navajo.stanford.edu
Subhash Suri will be visiting here on Thursday, March 5. Please
sign up to visit with him.
Subhash Suri schedule
Who: Subhash Suri,
What: AFLB talk
When: Thursday, March 5
Where: MJH 352
9:00- 9:30
9:30-10:00
10:00-10:30
10:30-11:00 Nils Nilsson MJH 216
11:00-12:00 Leo Guibas MJH 330
12:00-12:30
12:30- 1:30 AFLB talk MJH 352
1:30- 2:00 Don Knuth MJH 328
2:00- 2:30
2:30- 3:00
3:00- 4:00 Students MJH 352
4:00- 4:30
4:30- 5:00
∂19-Feb-87 1340 RA bag (again)
I talked to Franklin and he suggested calling the airline you traveled on.
He said that they would probably ship it to Mass. and this way it will not cost
you anything. Which airline did you travel on?
∂19-Feb-87 1350 RA be back
I am going to the bookstore.
Rutie
-----
∂19-Feb-87 1523 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU Program Committee Reception
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 15:22:56 PST
Date: Thu 19 Feb 87 15:23:03-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU>
Subject: Program Committee Reception
To: jmc@SAIL.STANFORD.EDU, feigenbaum@SUMEX-AIM.STANFORD.EDU,
nilsson@SCORE.STANFORD.EDU, tenenbaum@SRI-KL.ARPA, lerman@SRI-KL.ARPA,
engelmore@SUMEX-AIM.STANFORD.EDU, reddy@A.CS.CMU.EDU,
mck%mit-oz@MC.LCS.MIT.EDU, ai.woody@MCC.COM
cc: aaaI-OFFICE@SUMEX-AIM.STANFORD.EDU
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Message-ID: <12280391097.22.AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU>
You are invited to attend the opening reception for the Program Committee
meeting on Friday, March 20 in room 100 at the Stanford Park Hotel.
We look forward to seeing you then.
Claudia
-------
∂19-Feb-87 1554 JUSTESON@Sushi.Stanford.EDU Machine Learning book
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Feb 87 15:54:25 PST
Date: Thu 19 Feb 87 15:46:03-PST
From: John S. Justeson <JUSTESON@Sushi.Stanford.EDU>
Subject: Machine Learning book
To: jmc@Sail.Stanford.EDU
Message-ID: <12280395284.18.JUSTESON@Sushi.Stanford.EDU>
The Math Library turns out to have ordered it last week or so. I gave them
your Email address to notify you when it came in.
-- John
-------
∂19-Feb-87 1609 RA leaving
To: ZM, JMC
It's Thursday and I am leaving early.
∂20-Feb-87 0900 JMC
qlisp
∂20-Feb-87 0900 JMC
Oliver
∂20-Feb-87 0912 @REAGAN.AI.MIT.EDU:TLP@OZ.AI.MIT.EDU Luggage
Received: from REAGAN.AI.MIT.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 09:12:25 PST
Received: from LEGENDRE.AI.MIT.EDU by REAGAN.AI.MIT.EDU via CHAOS with CHAOS-MAIL id 23387; Fri 20-Feb-87 12:13:44 EST
Date: Fri, 20 Feb 87 12:12 EST
From: Tomas Lozano-Perez <TLP@OZ.AI.MIT.EDU>
Subject: Luggage
To: JMC@SU-AI.ARPA
In-Reply-To: The message of 12 Feb 86 18:22-EST from John McCarthy <JMC@SU-AI.ARPA>
Message-ID: <870220121204.3.TLP@LEGENDRE.AI.MIT.EDU>
John,
Thank you for returning my luggage so promptly. I don't know if my wife
told you that your luggage was still at JPL. I didn't take it because I
figured that it would make things more confusing (I didn't know whether
you would return for it). I told Steve Szermay and Tony Bejczy that I
was leaving it there. See you.
Tomas
∂20-Feb-87 1030 JMC
Rosenberg
∂20-Feb-87 1108 WINOGRAD@CSLI.Stanford.EDU home terminal paper
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 11:08:27 PST
Date: Fri 20 Feb 87 11:07:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: home terminal paper
To: jmc@sail
Cc: WINOGRAD@CSLI.STANFORD.EDU
This is a reminder to send me a copy. --t
∂20-Feb-87 1126 VAL proposal
I've made the changes you suggested yesterday. See arpa87.tex[1,val]. The main
additions are the first paragraph of the section "Proposed work", and the end
of the section "Reasoning about the effects of actions".
∂20-Feb-87 1139 EPPLEY@Score.Stanford.EDU Phone
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 11:39:22 PST
Date: Fri 20 Feb 87 11:37:56-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: Phone
To: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU, RA@Sail.Stanford.EDU
cc: Eppley@Score.Stanford.EDU
Message-ID: <12280612259.26.EPPLEY@Score.Stanford.EDU>
ITS will put the phone changes into the database this afternoon. I will
give you an update as soon as this has been completed.
LaDonna
-------
∂20-Feb-87 1144 RA your telephone
I just got a msg. from LaDonna that
ITS will put the phone changes into the database this afternoon. She will
let me know as soon as this has been completed.
∂20-Feb-87 1140 VAL computers in the USSR
I have two suggestions. First, it would be a good idea to invite Yuri
Yarim-Agaev. He's Bukovsky's closest associate in this country, who has
seriously studied the problem of the possible influence of computers on
the Soviet society and, I believe, has participated in meetings with
some people in Washington involved in defining the computer export policies.
He's somewhere on the East Coast now, and I can easily find out how to
contact him. The second suggestion is to contact Gerold Guensberg, the
Director of Delphic Associates in Falls Church, VA. His company has
published over 30 monographs on Soviet science and technology written by
emigres from the Soviet Union (including mine on theorem proving). I'm
sure he can recommend a good person from among his authors. (Actually,
Guensberg himself can be valuable as a participant. As I understand, he's a
former intelligence officer, and Soviet technology is his current area of
interest). His phone number is (703) 556-0278.
∂20-Feb-87 1203 RA Vacation
To: JMC, ZM
I would like to take the week of March 22 off to attend a conference in LA.
This is particularly important to me, since I am supposed to give a paper
there.
Thanks,
∂20-Feb-87 1317 VAL Grosof
He asked me to give him credit for introducing the expession "circumscription
policy". Would you mind if I do that? (I saw the word "policy" in connection
with circ'n in your Applications paper.)
∂20-Feb-87 1340 BSCOTT@Score.Stanford.EDU [ken down <HK.KSD@forsythe.stanford.edu>:]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 13:40:10 PST
Date: Fri 20 Feb 87 13:38:44-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: [ken down <HK.KSD@forsythe.stanford.edu>:]
To: JMC@Sail.Stanford.EDU, LES@Sail.Stanford.EDU
Message-ID: <12280634250.18.BSCOTT@Score.Stanford.EDU>
For your information. - Betty
---------------
Return-Path: <HK.KSD@forsythe.stanford.edu>
Received: from lindy.STANFORD.EDU by SCORE.STANFORD.EDU with TCP; Fri 20 Feb 87 13:30:02-PST
Received: by lindy.STANFORD.EDU; Fri, 20 Feb 87 13:29:45 PST
Date: Fri, 20 Feb 87 13:31:45 PST
From: ken down <HK.KSD@forsythe.stanford.edu>
To: bscott@score.stanford.edu
Dear Betty,
The Piggott chair is a venture capital chair which
means that we receive no cash until the fund is sold
in 5 to 7 years. We will fully fund John's salary in
your budget starting next year, and I'll explain the
details face-to-face as they're too complicated to try
to write down here. The main message is that this will
have no immediate impact on your budget. John will receive
an annual sum of $500 from the Provost and possibly an
additional contribution from the Dean. He will also receive
embossed University stationery.
-------
∂20-Feb-87 1353 EPPLEY@Score.Stanford.EDU phones
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 13:53:28 PST
Date: Fri 20 Feb 87 13:48:26-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: phones
To: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU, RA@Sail.Stanford.EDU
cc: Eppley@Score.Stanford.EDU
Message-ID: <12280636018.23.EPPLEY@Score.Stanford.EDU>
ITS will wait and make the phone changes after Zohar's ET arrives. It
should be here next week. Thanks
LaDonna
-------
Replying-To: EPPLEY@Score.Stanford.EDU
Also-to: ZM
Also-to: JMC
Also-to: RA
Reply-cc: Eppley@Score.Stanford.EDU
Reply-Subject: re: phones
Reply-Text:
[In reply to message from EPPLEY@Score.Stanford.EDU sent Fri 20 Feb 87 13:48:26-PST.]
∂20-Feb-87 1411 VAL
I've added the formula.
∂20-Feb-87 1913 KIRSH%OZ.AI.MIT.EDU@MC.LCS.MIT.EDU AAAI workshop on Foundations
Received: from MC.LCS.MIT.EDU by SAIL.STANFORD.EDU with TCP; 20 Feb 87 19:13:29 PST
Date: Fri 20 Feb 87 22:16-EST
From: David Kirsh <KIRSH%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU>
Subject: AAAI workshop on Foundations
To: jmc@SAIL.STANFORD.EDU
CC: kirsh%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU
John,
What forms must I complete to get the $10,000 you mentioned the
AAAI would provide for our workshop on the foundations of AI?
Regards
-- David
∂22-Feb-87 0900 JMC
yuri
∂22-Feb-87 0900 JMC
ai.txt
∂22-Feb-87 0929 NILSSON@Score.Stanford.EDU Re: library keys
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 22 Feb 87 09:29:44 PST
Date: Sun 22 Feb 87 09:27:56-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: library keys
To: JMC@Sail.Stanford.EDU
cc: NILSSON@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 19 Feb 87 17:36:00-PST
Message-ID: <12281112882.10.NILSSON@Score.Stanford.EDU>
Ok, I'll look into the library key situation. (How come when
one "solves" a problem around here it doesn't stay solved?)
--Nils
-------
∂22-Feb-87 2146 CLT
please run the dishwasher - its all ready
∂23-Feb-87 0535 GROSOF@Score.Stanford.EDU recommendation and discussion
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 05:35:22 PST
Date: Mon 23 Feb 87 05:33:55-PST
From: Benjamin N. Grosof <GROSOF@Score.Stanford.EDU>
Subject: recommendation and discussion
To: jmc@Sail.Stanford.EDU
cc: grosof@Score.Stanford.EDU
Message-ID: <12281332424.13.GROSOF@Score.Stanford.EDU>
Hi John,
Before you write/send a letter of recommendation for me, I'd like to
talk to you a bit more about what I've been up to lately. Is that OK
with you? I've kind of been waiting to tell you what I've been
working on, since I wanted to have things more well formulated, and
since I knew I'd be giving the NM seminar talk, but now it's getting
near the time when schools want letters.
The last time I brought it up, you asked me to give you things in
writing. Tonight, I've put a copy of two more documents under your
door: a thesis summary and a research overview, which I have sent out
with job applications. Of what I've given you (i.e. along with the
papers I gave you a week or two ago), they are definitely the highest
priority for you to read: they'll give you the overall picture. So
now you have all of what I've written. Unfortunately, the more purely
circumscriptive-oriented stuff is mostly not yet written; and in my
talk this week I didn't have time to get to the more interesting and
novel part.
Since Nils has already sent his letter out, I don't think there's
tremendous urgency from schools to receive your letter very soon, but
I think several would like it within a month or less from now. If you
prefer, I can try to write some more things specially for you. But I
didn't want to cross signals since I know various places, e.g. NYU,
have sent, or soon will send, you requests asking for your letter.
In any event, I'd like very much to get your reactions to my latest
ideas about non-monotonic formalisms and locality sometime in the next
week or two, before I go on the road interviewing in mid-March.
Benjamin
P.S. Also, you might want to talk to Nils or Vladimir or Mike Genesereth
(Mike especially about the learning stuff) to get a clearer picture of
my work. I think they'd be happy to.
-------
∂23-Feb-87 0833 ULLMAN@score.stanford.edu Andy Goldberg
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 08:33:30 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Mon, 23 Feb 87 08:31:51 PST
Date: Mon 23 Feb 87 08:31:18-PST
From: Jeffrey D. Ullman <ULLMAN@score.stanford.edu>
Subject: Andy Goldberg
To: fndsch@navajo.stanford.edu
Message-Id: <12281364718.32.ULLMAN@Score.Stanford.EDU>
Andy would like to interview on the 11th, assuming the 12th is unavailable
(we have another candidate on the 12th, no?)
Would you sign up for times with Rosemary Napier (rfn@sail)?
Thanks.
---jeff
-------
∂23-Feb-87 0930 KHOWARD@Score.Stanford.EDU message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 09:30:54 PST
Date: Mon 23 Feb 87 09:26:59-PST
From: Katherine Howard <KHOWARD@Score.Stanford.EDU>
Subject: message
To: shankar@Score.Stanford.EDU
cc: jmc@Sail.Stanford.EDU
Message-ID: <12281374852.31.KHOWARD@Score.Stanford.EDU>
Charles Junkerman from the H&S Dean's Office called about your proposal for a
new undergraduate CS course. He says that the budget on that proposal needs
clarification urgently. Please call him at 5-1533.
--Kathy
-------
∂23-Feb-87 0943 AI.WOODY@MCC.COM [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
Received: from MCC.COM by SAIL.STANFORD.EDU with TCP; 23 Feb 87 09:43:26 PST
Date: Mon 23 Feb 87 11:42:32-CST
From: Woody Bledsoe <AI.Woody@MCC.COM>
Subject: [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
To: Newell@A.CS.CMU.EDU, Feigenbaum@SUMEX-AIM.STANFORD.EDU,
Nilsson@SAIL.STANFORD.EDU, Minsky@MC.LCS.MIT.EDU, JMC@SAIL.STANFORD.EDU,
PHW@MC.LCS.MIT.EDU, Reddy@A.CS.CMU.EDU, Simon@A.CS.CMU.EDU, Bledsoe@MCC.COM
cc: AI.Woody@MCC.COM
Message-ID: <12281377685.35.AI.WOODY@MCC.COM>
Allen, Ed, Nils, Marvin, John, Pat, Raj, Herb:
I would like to get your suggestions for our next President Elect.
We have managed to attract to the post of President most of the
early leaders of AI; I hope we can continue to identify
significant candidates. I'd be happy to have your ideas,
to help the nominating committee settle on the final nominees.
Woody
PS: here is what I sent the committee:
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$
Mail-From: AI.WOODY created at 23-Feb-87 09:03:08
Date: Mon 23 Feb 87 09:03:08-CST
From: Woody Bledsoe <AI.Woody@MCC.COM>
Subject: Nominating Committee for 1987
To: brachman@SRI-KL.ARPA, mcdermott@A.CS.CMU.EDU, rich@MC.LCS.MIT.EDU,
shortliffe@SUMEX-AIM.STANFORD.EDU, aaai-office@SUMEX-AIM.STANFORD.EDU
cc: AI.Woody@MCC.COM
Message-ID: <12281348665.35.AI.WOODY@MCC.COM>
Dear Nominating Committee:
The AAAI Nominating Committee for 1987 is
Woody Bledsoe (Chairman) - Recent Ex President
Ron Brachman - Retiring Councilor
John McDermott - "
Charles Rich - "
Edward Shortliffe - "
This year we must nominate candidates for AAAI Councilors (three
openings) and for President Elect (who would succeed Raj Reddy
in 1989).
Last year the system worked pretty well as follows: each
committee member indepently sent their choices, we then
consolidated the list, did some culling by arpanet, and
finally settled the whole thing with a conference call.
The ballots are to be sent out by April 13. We are required to send
them by May 13, which is 60 days prior to the AAAI Annual
Conference, but I agree with Claudia that we should err on
the safe side.
Our job, as I see it, is to nominate candidates to fill the three
openings that will occur in the council this year, and nominate
a president elect. The three new councilors would serve during
the three year period 1987-90, and the president elect would
serve as president during 1989-91
Last year we put eight names on the ballot, from which four
were elected. Since only three are to be elected this year
we might want to restrict our final list to six. I'd like
you opinion on this.
Obviously, it would be wise for each of us to get advice others
on these nominations. What we want is a slate that would be
widely respected. The power to nominate is tantamount to the
power to elect (almost) and I take that very seriously, as I
know you do.
The following is material from last years nominations. That
might be useful in your deliverations, especially in seeing
who has served before, etc.
I am including Gen Charniak on the mailing list and will be
asking for his advice. Last year due to a mixup in
communications, he was not able to participate. He has
no vote but will advise. Any of you that has a problem with
please message me privately.
My phone numbers are 512-338-3560, 512-453-1101 (home).
Woody
***************************************************************
**************************************************************
1986 MATERIAL
19-May-86 15:59:45-CDT,1258;000000000001
Mail-From: AI.WOODY created at 19-May-86 15:59:44
Date: Mon 19 May 86 15:59:44-CDT
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Slate for AAAI Council Elections
To: aaai-office@SUMEX-AIM.ARPA
cc: Charniak@YALE.ARPA, Krd%MIT-OZ@MIT-XX.ARPA, Stan@SRI-AI.ARPA,
Stefik@XEROX.COM, AI.Woody@MCC.ARPA
Message-ID: <12208013262.13.AI.WOODY@MCC.ARPA>
Claudia, 19 May 1986
The nominating committee has selected the following names
for the ballot, for positions on the AAAI Council.
We would like for all of these names to be placed on the ballot
unless one or more of them are unwilling to serve. (You have already
agreed to contact each of the nominees to verify their willingness
to be nominated.) If fewer than eight are willing to be nominated,
then let me know and we will generate some replacements.
Woody,
(For the committee: Mark, Stan, Randy, Gene(not participating).)
David Barstow (Schlumberger)
Lynn Conway (U Mich)
Dick Duda (Syntelligence)
Barbara Grosz (SRI)
Arvind Joshi (U Penn)
Doug Lenat (MCC)
Lozano-Perez (MIT)
Judea Pearl (UCLA)
Terry Winograd (Stanford)
Bill Woods (Apex)
These are alphabetically arranged, not implying our preference order.
(**** Note (2/23/87) I believe that Terry Winograd and Dick Duda
asked that their names be removed)
-------
3-Mar-86 17:02:12-CST,20492;000000000001
Mail-From: AI.WOODY created at 3-Mar-86 17:02:11
Date: Mon 3 Mar 86 17:02:11-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: AAAI Nominations for 1986
To: Charniak@YALE.ARPA, Krd%MIT-OZ@MIT-XX.ARPA, Stan@SRI-AI.ARPA,
Stefik@XEROX.COM
cc: AI.Woody@MCC.ARPA
Gene, Randy, Stan, and Mark:
The AAAI Nomination Committee this year consists of
Woody Bledsoe - Chair (As immediate past president)
Eugene Charniak (As councilors whose terms are
Randy Davis ending in 1986)
Stan Rosenschein
Mark Stefik
The ballots are to be sent out by May 10. We are required to send
them by June 10, which is 60 days prior to the AAAI Annual
Conference, but I agree with Claudia that we should err on
the safe side.
Our job, as I see it, is to nominate candidates to fill the four
openings that will occur in the council this year. The four
new councilors would serve during the three year period
1986-89.
We also might consider nominating a candidate for President-
Elect, to serve during the period 1987-89. However, I feel
that that election should be help next year year instead of
this. If you feel differently, please let me know and we
can discuss it. In any event PLEASE PASS ON TO ME any
recommendations that you may have for that (President-Elect),
because I will serve as Nominations Chair again next year,
and am anxious to get the best person for that job.
Following this message is the list of
Present and Past officer of AAAI, from Claudia. I find
this helpful in determining whether to renominate someone
who has already served.
Please send to me, as soon as you can, the list of Council
candidates that you feel should be nominated. I want to
have time for a good discussion before we make the formal
nominations. I expect that much of the discussion between
us can be done over the Net, followed by at least on
conference call.
(We will also have to determine how many persons that
we want to put on the ballot for the four positions,
with the top four vote getters being elected.)
We won't have time to advertise for other nominations from
members, and that is too bad because I always wonder if the
process is democartic enough. But we will, of course, be getting
advice from our friends and trusted acquaintances, and that
should help.
My phone number is 512-834-3560 (Work), 512-453-1101 (Home).
Woody
_________________________________________________________________
20-Feb-86 10:35:44-CST,7322;000000000001
Return-Path: <AAAI-OFFICE@SUMEX-AIM.ARPA>
Received: from SUMEX-AIM.ARPA by MCC.ARPA with TCP; Thu 20 Feb 86 10:35:33-CST
Date: Thu 20 Feb 86 08:36:38-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: list of past and current officers
To: ai.woody@MCC.ARPA
cc: aaai-OFFICE@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Message-ID: <12184896696.29.AAAI-OFFICE@SUMEX-AIM.ARPA>
Woody,
Per your request, here is the list of past and current AAAI
officers.
Cheers,
Claudia
LIST OF CURRENT AAAI OFFICERS
Woody Bledsoe ai.woody@mcc President 84-85
MCC Past Pres 85-87
9430 Research Blvd
Austin, TX 78767
Ron Brachman brachman@sri-kl Councilor 84-87
AT&T Bell Labs
600 Mountain Rd
3D-479
Murray Hill, NJ 07974
John Seely Brown Brown@parc Councilor 85-88
Xerox Palo Alto Research Center
333 Coyote Hill Road
Palo Alto, CA 94303
Bruce G. Buchanan 415:497-0935 membership 79-
Computer Science Department 321-2561 home councilor 79-81
Stanford University buchanan@sumex
Stanford, CA 94305
Eugene Charniak councilor 83-6
Computer Science Department
Brown University
Providence, RI 02912
Randall Davis councilor 83-6
MIT-AI Laboratory Tutorial Chair
545 Technology Square krd@mit-mc '85
Cambridge, MA 02139
Robert Engelmore 415:327-6600 editor AI Mag 81-
Teknowledge
525 University Avenue bengelmore@sri-kl
Palo Alto, CA 94301
Lee D. Erman 415:327-6600 publications 79-
Teknowledge, Inc. councilor 79-80
525 University Avenue lerman@sri-kl
Palo Alto, CA 94
Richard Fikes 415-965-5500 Sec-Treasurer 84-
IntelliCorp Fikes@usc-ecl
1975 El Camino Real West
Mountain View, CA 94040-2216
Tom Kehler 415-965-5500 Program Chair 86
IntelliCorp Kehler@usc-ecl
1975 El Camino Real West
Mountain View, CA 94040-2216
John McCarthy 415:497-4430 president 83-4
Computer Science Department councilor 80-2
Stanford University jmc@su-ai
Stanford, CA 94305 jmc-lists@su-ai
John McDermott mcdermott@cmu-cs-a Councilor 84-87
Computer Science Dept
Carnegie-Mellon University
Pittsburgh, PA 15213
Rysard Michalski Michalski@ui-uc Councilor 85-88
Dept of Computer Science
University of Illinois
1304 West Springfield
Urbana, IL 61801
217-333-6725
!
Tom Mitchell Mitchell@rutgers Councilor 85-88
Dept of Computer Science
Rutgers University
New Brunswick, NJ 08903
Fernando Pereira Pereira@sri-ai Councilor 85-88
AI Center
SRI International
333 Ravenswood Avenue
Menlo Park, CA 94025
D. Raj Reddy 412:578-2597 councilor 79-81 82-5
Computer Science Department 683-8779 home finance 80-
Carnegie-Mellon University reddy@cmua President-elect 85-87
Pittsburgh, PA 15213
Charles Rich rich@mit-mc councilor 84-87
MIT AI Lab
545 Technology Sq
Cambridge, MA 02139
Stanley J. Rosenschein 415:859-4167 councilor 82-3 83-6
Artificial Intelligence Center Program Chair 86
SRI International stan@sri-ai
Menlo Park, CA 94025
Edward Shortiffe, TC117 Shortliffe@sumex Councilor 84-87
Stanford Medical Center
Stanford, CA 94305
Mark Stefik councilor 83-6
Xerox PARC
3333 Coyote Hill Road stefik@parc
Palo Alto, CA 94304
Peter Szolovits Szolovits@mit-mc AIM Chair 84-
MIT Computer Science Lab
545 Technology Sq.
Cambridge, MA 02139
Jay M. Tenenbaum 415:496-4699 conference 80-
Schlumberger Palo Alto Research Tenenbaum@sri-kl
3340 Hillview St.
Palo Alto, CA 94304
Patrick H. Winston 617:253-6218 councilor 79-81
MIT-AI Laboratory President 85-
545 Technology Square phw@mit-mc President-elect
Cambridge, MA 02139 84-85
[Prefers US Mail or phone call]
! FORMER AAAI OFFICIALS
Saul Amarel Amarel@rutgers Councilor 82-85
Dept of Computer Science
Rutgers University
New Brunswick, NJ 08903
Robert M. Balzer 213-822-1511 program 80
USC/ISI
4676 Admiralty Way balzer@isif
Marina del Rey, CA 90291
Daniel G. Bobrow 415:494-4438 councilor 80-83
Xerox PARC
3333 Coyote Hill Road bobrow@parc
Palo Alto, CA 94304
Scott Fahlman 412:578-2575 local 1982
Computer Science Department
Carnegie-Mellon University fahlman@cmuc
Pittsburgh, PA 15213
Edward A. Feigenbaum 415:497-4079 president 80-1
Computer Science Department 493-5618 home
Stanford University feigenbaum@sumex
Stanford, CA 94305
Jerome A. Feldman 716:275-5478 councilor 80-2
Computer Science Department
University of Rochester feldman@sumex
Rochester, NY 14627
Michael Genesereth Genesereth@sumex Councilor 82-85
Dept of Computer Science Program 83
Stanford University
Stanford, CA 94305
Barbara J. Grosz 415:859-4839 councilor 81-4
Artificial Intelligence Center
SRI International grosz@sri-ai
Menlo Park, CA 94025
Peter Hart 415-325-9339 Councilor 82-85
Syntelligence Hart@sri-ai Strategic Planning
1000 Hamlin Ct Chair 85
Sunnyvale, CA
Frederick Hayes-Roth 415:327-6600 tutorials 80 81
Teknowledge
525 University Avenue rhayes-roth@sri-kl
Palo Alto, CA 94301
Douglas Lenat tutorial 84
Computer Science Department
Stanford University
Stanford, CA 94305
Drew McDermott 203:436-4771 councilor 80-83
Computer Science Department
Yale University mcdermott@yale
New Haven, CT 06520
Marvin Minsky 617:253-5864 president 81-2
MIT-AI Laboratory councilor 80-1
545 Technology Square minsky@mit-mc
Cambridge, MA 02139
Nils J. Nilsson 415:859-7735 president 82-3
Dept of Computer Science councilor 79-1
Stanford University Nilsson@score
Stanford, CA 94305
Allen Newell 412:578-2602 president 79-80
Computer Science Department 421-3668 home
Carnegie-Mellon University newell@cmua
Pittsburgh, PA 15213
Charles Rich 617-253-7877 tutorials 82 83
MIT AI Laboratory, Rm 342 643-7465 home and Councilor 84-87
545 Technology Square rich@mit-ai
Cambridge, MA 02139
Charles J. Rieger 703:476-6100 councilor 81-4
Scion
12310 Pinecrest Road
Reston, VA 22091
Earl D. Sacerdoti 408:737-7960 councilor 79-81
Machine Intelligence 415:325-4119 home
330 Potrero Avenue sacerdoti@sri-kl
Sunnyvale, CA 94086
Herbert A. Simon 412:578-2787 councilor 80-2
Department of Psychology
Carnegie-Mellon University simon@cmua
Pittsburgh, PA 15213
Gerald J. Sussman 617:253-5874 councilor 81-4
MIT AI Laboratory
545 Technology Square gjs@mit-ai
Cambridge, MA 02139 (CAL Tech now?)
Alan M. Thompson editor AI Mag 80-1
Donald E. Walker 201-582-7406 sec-treas 79-83
Bell Communications Research
435 South St.
Morristown, NJ 07960
David L. Waltz 217:333-6071 councilor 79-80 81-3
Thinking Machines Inc. program 82
Walham, MA
Bonnie L. Webber 215:243-7745 councilor 81-4
Computer & Information Science
University of Pennsylvania bonnie.upenn@udel
Philadelphia, PA 15213
Terry Winograd 415:497-2273 councilor 80-1
Computer Science Department
Stanford University tw@su-ai
Stanford, CA 94305 winograd@parc
William A. Woods 617:497-3361 councilor 81-2
Applied Expert Systems
5 Cambridge Ctr. woods@bbng
Cambridge, MA 02142
-------
-------
∂23-Feb-87 1045 BSCOTT@Score.Stanford.EDU Resignation letter, Rutie
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 10:45:08 PST
Date: Mon 23 Feb 87 10:42:39-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Resignation letter, Rutie
To: JMC@Sail.Stanford.EDU
cc: ZM@Sail.Stanford.EDU, BScott@Score.Stanford.EDU
Message-ID: <12281388629.27.BSCOTT@Score.Stanford.EDU>
John, I talked with Employee Relations about asking Rutie for a revised,
simple resignation letter, and am advised that we should not do this at the
present time. The unsatisfactory performance issues have to be clarified
and an official response to her letter prepared. Short of this, Employee
Relations says it is a classic situation leading up to a possible suit
by Rutie.
As soon as I have the information promised by Zohar on Friday, I will meet
with Employee Relations representatives to see what we should do next.
Betty
-------
∂23-Feb-87 1047 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
REPRESENTING DEFAULTS WITH EPISTEMIC CONCEPTS
Kurt Konolige, SRI International
Karen Myers, Stanford
Thursday, February 26, 4pm
Bldg. 160, Room 161K
Reasoning about defaults --- implications that typically hold,
but which may have exceptions --- is an important part of
commonsense reasoning. We present some parts of a theory of
defaults, concentrating on distinctions between various subtle
ways in which defaults can be defeated, and on the adjudication
of conflicting defaults under hierarchic inheritance. In order
to represent this theory in a formal system, it seems necessary
to use the epistemic concept of self-belief. We show how to
express the theory by an almost-local translation into
autoepistemic logic, which contains the requisite epistemic
operators. Just to be controversial, we also argue that
circumscription (pointwise, schematic, prioritized, or otherwise)
is insufficient for this task.
∂23-Feb-87 1131 ZM
BS
My November Message to Rutie
Betty,
Since I returned from my sabbatical on Sept. 1, 1986, I have been
extremely unhappy with Rutie's performance and attitude toward her work.
As a result, I sent her the following message on Nov. 18, 1986:
"Rutie,
I am extremely unhappy about our working relationship --
we should get a divorce. I am ready to help you to find a more
appropriate faculty member to work with.
Zohar"
The next day, Rutie rushed to my office and I explained her in detail
why I was unhappy with her work:
(a) She makes so many mistakes (typos and accounting) that I cannot rely
on anything she does for me.
(b) She sometimes forgets to do some of the things I ask and she
does not follow up properly on things that require continuous attention.
(Once I suggested that she record in a small booklet everything she is
supposed to do, as my previous secretary Diana did, but she said
she did not think it was such a good idea.)
(c) She keeps irregular working hours and she definitely does not work a
full 8 hours. At that time she was supposed to work, upon her request,
from 9am to 5pm with no lunch break, but very often she did take a
lunch break. (I reminded her that the day I wrote her the message,
she came at 9am, attended Winograd's class from 9 to 10 and did leave
for an hour at lunch time. On that day she worked until 5pm, only 6
hours.)
To summarize, I told her that there is no way I can and will continue to
work with her and offered to help her to find a more appropriate faculty
member.
Her reaction was:
* She argued only with my complaint (c). She claimed that she was actually
working more than I realize.
* There is no other faculty member she is ready to work with, and she would
rather leave than move to another position.
* She asked for a three-month period to try to improve, and if it did
not work, she would leave.
This three month period is now over. During this period, I continuously
pointed out to Rutie each of the serious mistakes she was making. Problems
(a) and (b) have not been resolved.
Zohar
∂23-Feb-87 1134 ZM
BS
My November Message to Rutie
Betty,
Since I returned from my sabbatical on Sept. 1, 1986, I have been
extremely unhappy with Rutie's performance and attitude toward her work.
As a result, I sent her the following message on Nov. 18, 1986:
"Rutie,
I am extremely unhappy about our working relationship --
we should get a divorce. I am ready to help you to find a more
appropriate faculty member to work with.
Zohar"
The next day, Rutie rushed to my office and I explained her in detail
why I was unhappy with her work:
(a) She makes so many mistakes (typos and accounting) that I cannot rely
on anything she does for me.
(b) She sometimes forgets to do some of the things I ask and she
does not follow up properly on things that require continuous attention.
(Once I suggested that she record in a small booklet everything she is
supposed to do, as my previous secretary Diana did, but she said
she did not think it was such a good idea.)
(c) She keeps irregular working hours and she definitely does not work a
full 8 hours. At that time she was supposed to work, upon her request,
from 9am to 5pm with no lunch break, but very often she did take a
lunch break. (I reminded her that the day I wrote her the message,
she came at 9am, attended Winograd's class from 10 to 11 and did leave
for an hour at lunch time. On that day she worked until 5pm, only 6
hours.)
To summarize, I told her that there is no way I can and will continue to
work with her and offered to help her to find a more appropriate faculty
member.
Her reaction was:
* She argued only with my complaint (c). She claimed that she was actually
working more than I realize.
* There is no other faculty member she is ready to work with, and she would
rather leave than move to another position.
* She asked for a three-month period to try to improve, and if it did
not work, she would leave.
This three-month period is now over. During this period, I continuously
pointed out to Rutie each of the serious mistakes she was making. Problems
(a) and (b) have not been resolved.
Zohar
∂23-Feb-87 1207 WINOGRAD@CSLI.Stanford.EDU home terminal essay
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 12:06:57 PST
Date: Mon 23 Feb 87 12:06:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: home terminal essay
To: jmc@sail
Cc: WINOGRAD@CSLI.STANFORD.EDU
Thanks for sending it. Is there a publication place I can cite if I
quote it? --t
∂23-Feb-87 1357 WINOGRAD@CSLI.Stanford.EDU re: home terminal essay
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 13:57:01 PST
Date: Mon 23 Feb 86 13:48:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: re: home terminal essay
To: JMC@SAIL.STANFORD.EDU
Thanks. --t
∂23-Feb-87 1427 WOODWARD@Score.Stanford.EDU Network Connection Charges
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 14:27:40 PST
Date: Mon 23 Feb 87 14:13:49-PST
From: Deborah Woodward <WOODWARD@Score.Stanford.EDU>
Subject: Network Connection Charges
To: McCarthy@Score.Stanford.EDU
cc: RA@Sail.Stanford.EDU, Bscott@Score.Stanford.EDU,
Woodward@Score.Stanford.EDU
Message-ID: <12281427070.14.WOODWARD@Score.Stanford.EDU>
As explained in Les Earnest's memo of January 17 we are now charging for
network connections of hosts that are in Margaret Jacks Hall as of January
1st. 1987. The following host name/names are what we have as belonging to
you. This will be a monthy charge per host. Would you please provide us
with an account number so we can make the appropriate billing.
HOST Charge
Ibmrtpc1 $30.00
Ignorant $30.00
Mt-st-coax $30.00
Gang-of-four $30.00
Total $120.00
Thank you,
CSD-CF
-------
∂23-Feb-87 1516 RA Trip to Anchorage and Japan
Franklin called to let you know that he got you seats on coach. Can he
cancel your reservation on business seats?
Thanks,
∂23-Feb-87 1623 VAL workshop on the frame problem
I just noticed that the workshop will be held on the first 2 days of
Passover. So I'm afraid I won't be able to attend (and probably some
other contributors too).
∂23-Feb-87 1655 JJW Re: Alex Nicolau - Student Session
To: Qlisp@SAIL.STANFORD.EDU
∂23-Feb-87 1507 @Score.Stanford.EDU,@Sushi.Stanford.EDU:agarwal@sonoma.stanford.edu Re: Alex Nicolau - Student Session
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 15:06:37 PST
Received: from Sushi.Stanford.EDU by SCORE.STANFORD.EDU with TCP; Mon 23 Feb 87 14:26:50-PST
Received: from sonoma.stanford.edu by Sushi.Stanford.EDU with TCP; Mon 23 Feb 87 13:50:30-PST
Received: by sonoma.stanford.edu; Mon, 23 Feb 87 13:53:44 PST
Date: 23 Feb 1987 1353-PST (Monday)
From: Anant Agarwal <agarwal@sonoma.stanford.edu>
To: phd@sushi.stanford.edu, csl-everyone@sierra.stanford.edu
Cc: agarwal@sonoma.stanford.edu
Subject: Re: Alex Nicolau - Student Session
Alex Nicolau will be speaking on "A Support Environment for
Parallel-Program Development" at 10AM Thursday Feb 26 in
AEL 109. We will have a student session with him after the talk.
anant
∂23-Feb-87 1827 RA Coming in late tomorrow
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU, BS@SAIL.STANFORD.EDU
I will come in late tomorrow because I have to go to the DMV to renew
my driver's license.
Rutie
------
∂23-Feb-87 2208 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 22:08:43 PST
Date: Mon 23 Feb 87 22:06:37-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: [Woody Bledsoe <AI.Woody@MCC.COM>: Nominating Committee for 1987]
To: AI.Woody@MCC.COM, Newell@A.CS.CMU.EDU, Nilsson@SAIL.STANFORD.EDU,
Minsky@MC.LCS.MIT.EDU, JMC@SAIL.STANFORD.EDU, PHW@MC.LCS.MIT.EDU,
Reddy@A.CS.CMU.EDU, Bledsoe@MCC.COM, herb.simon@A.CS.CMU.EDU
In-Reply-To: <12281377685.35.AI.WOODY@MCC.COM>
Message-ID: <12281513141.19.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Friends, I was about to write a message suggesting that it would be appropriate
to nominate an "industry" person that we all trust, but then it came to mind
that the two top people I had in mind anyway were "industry" people, to wit:
Dan Bobrow
John Seely Brown
Both are "'60s people" (so is Pat) so we're gradually working our way
forward in time, so to speak.
Ed
-------
∂23-Feb-87 2249 FEIGENBAUM@SUMEX-AIM.STANFORD.EDU Re: NAE election
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Feb 87 22:49:49 PST
Date: Mon 23 Feb 87 22:40:38-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
Subject: Re: NAE election
To: JMC@SAIL.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 23 Feb 87 16:26:00-PST
Message-ID: <12281519333.19.FEIGENBAUM@SUMEX-AIM.STANFORD.EDU>
John, yes, it was. Have they notified you officially?
Anyway, it was LONG LONG overdue. Best wishes and thanks to you for all you
have done for the science and for me. (I saved the nomination form in case
you want to see it)....Ed
-------
∂24-Feb-87 0703 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Your schedule in Tokyo
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 07:03:41 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Tue 24 Feb 87 07:01:12-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Tue 24 Feb 87 23:02:17
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Tue, 24 Feb 87 23:01:47 jst
Date: Tue, 24 Feb 87 23:01:47 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8702241401.AA25951@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20,
clt%sail.stanford.edu%sumex-aim@ntt-20
Subject: Your schedule in Tokyo
Dear John and Carolyn,
(1) I talked to Mr. Arima at ICOT about your visit. He is interested
in circumscription, and he is hoping to have a meeting at ICOT on
April 7 (if possible). His plan for the day is (i) to have a
discussion with you and (ii) to hear your lecture on common sense
knowldge. A small group of people interested in the foundation of AI
will come to the meeting.
(2) I talked to Dr. Nori Suzuki of IBM Japan. He is the director of
Tokyo Research Center, and he says that he would like to have your
visit to the Research Center anytime after April 4.
(3) Shigeki Goto and Ikuo Takeuti are wishing to have your visit to
NTT's Musashino Laboratory.
Please let me hear your opinion about these possible plans.
** masahiko **
∂24-Feb-87 0822 SCHAFFER@sushi.stanford.edu Revised Visit Schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 08:22:08 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 24 Feb 87 08:20:53 PST
Date: Tue 24 Feb 87 08:20:08-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Revised Visit Schedule
To: fndsch@navajo.stanford.edu
Message-Id: <12281624827.15.SCHAFFER@Sushi.Stanford.EDU>
What follows is a revised and annotated summary of visits by faculty
candidates in foundations.
Candidate Host Date(s) Time of Talk
Cole Mayr 9 February 10
Sleator Knuth 26 February (possibly 27 also) 12:30
Friedman Mayr 4 March 2:15
Suri Guibas 5 March (possibly 6 also) 12:30
Mitchell Pratt 10 March 10:00
Goldberg Ullman 11 March ?
Natarajan Papadimitriou 12 March 12:30
Other notes:
1. Student meetings with Friedman and Goldberg should not be scheduled
in conflict with Professor Mayr's course (363B) or with Professor
Papadimitriou's course (364).
2. I need titles and abstracts for Goldberg and Natarajan, ASAP.
3. Professor Pratt should take care of announcing Mitchell's talk and
getting on the seminar calendar (to do this send a note to Khoward@score
by next Monday (2 March)).
4. All other talks will be announced as regular or special AFLBs.
5. I have asked Professor Golub to announce Friedman's talk in his
Monday afternoon NA seminar.
AAS
-------
∂24-Feb-87 0832 SCHAFFER@sushi.stanford.edu Time of Goldberg's talk
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 08:32:10 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 24 Feb 87 08:30:56 PST
Date: Tue 24 Feb 87 08:30:02-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: Time of Goldberg's talk
To: fndsch@navajo.stanford.edu
Message-Id: <12281626631.15.SCHAFFER@Sushi.Stanford.EDU>
Andrew Golberg's talk on 11 March will be at 10 in MJH252. All other
talks will be or have been in MJH352.
AAS
-------
∂24-Feb-87 0900 JMC
camera for class picture
∂24-Feb-87 0916 ullman@navajo.stanford.edu Re: Revised Visit Schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 09:16:48 PST
Received: by navajo.stanford.edu; Tue, 24 Feb 87 09:15:21 PST
Date: Tue, 24 Feb 87 09:15:21 PST
From: Jeff Ullman <ullman@navajo.stanford.edu>
Subject: Re: Revised Visit Schedule
To: SCHAFFER@sushi.stanford.edu, fndsch@navajo.stanford.edu
Goldberg's talk is now scheduled
for 10AM.
---jeff
∂24-Feb-87 1001 RA
Appointments for search committee
Please tell me when you want to meet with Sleator and Suri
Thanks,
Danny Sleator schedule
Who: Danny Sleator, Carnegie Mellon University
What: AFLB talk ``Competitive Algorithms for On-Line Problems''
When: Thursday, February 26
Where: MJH 352
9:00- 9:30
9:30-10:00
10:00-10:30
10:30-11:00 Ernst Mayr MJH 334
11:00-11:30 Jeff Ullman MJH 338
11:30-12:00 Nils Nilsson MJH 216
12:00-12:30 fast food lunch
12:30- 1:30 AFLB talk MJH 352
1:30- 2:00 Don Knuth MJH 328
2:00- 2:30 Leo Guibas MJH 330
2:30- 3:00 Christos P. MJH 332
3:00- 4:00 Students MJH 352
4:00- 4:30 Vaughan Pratt MJH 428
4:30- 5:00
Subhash Suri schedule
Who: Subhash Suri,
What: AFLB talk
When: Thursday, March 5
Where: MJH 352
9:00- 9:30
9:30-10:00
10:00-10:30 Jeff Ullman MJH 338
10:30-11:00 Nils Nilsson MJH 216
11:00-12:00 Leo Guibas MJH 330
12:00-12:30 fast food lunch
12:30- 1:30 AFLB talk MJH 352
1:30- 2:00 Christos P. MJH 332
2:00- 2:30 Don Knuth MJH 328
2:30- 3:00
3:00- 4:00 Students MJH 352
4:00- 4:30 Ernst Mayr MJH 334
4:30- 5:00 Vaughan Pratt MJH 428
∂24-Feb-87 1001 OKUNO@SUMEX-AIM.STANFORD.EDU
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 10:01:42 PST
Date: Tue 24 Feb 87 09:51:50-PST
From: Hiroshi "Gitchang" Okuno <Okuno@SUMEX-AIM.STANFORD.EDU>
To: JMC@SAIL.STANFORD.EDU
cc: CLT@SAIL.STANFORD.EDU, IGS@SAIL.STANFORD.EDU, JJW@SAIL.STANFORD.EDU,
Okuno@SUMEX-AIM.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 23 Feb 87 01:09:00-PST
Message-ID: <12281641522.67.OKUNO@SUMEX-AIM.STANFORD.EDU>
FYI, the following papers discuss Groebner bases:
B. Buchberger : "Groebner bases", in Recent Trends in Multidimensional
Systems Theory, N.K. Bose (ed), D. Reidel Publ. Comp. 1985
D.S. Arnon & T.W. Sederberg, "Implicit equations for parametric
surfaces by Groebner basis", Proc. 1984 MACSYMA User's Conf. p.431.
G. Gianni and B. Trager, "GCD's and factoring multivariate polynomials
using Groebner bases", Lec. Notes Comp. Sci., No. 204, p.409 1985
- Gitchang -
-------
∂24-Feb-87 1313 NILSSON@Score.Stanford.EDU Re: algebraic computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 13:13:44 PST
Date: Tue 24 Feb 87 13:09:55-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: algebraic computation
To: JMC@Sail.Stanford.EDU
cc: IGS@Sail.Stanford.EDU, NILSSON@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 24 Feb 87 12:55:00-PST
Message-ID: <12281677581.43.NILSSON@Score.Stanford.EDU>
Igor should write up a brief paragraph describing the course. We'll
pass the paragraph thru the curric committee and advertise the course
using his paragraph. -Nils
-------
∂24-Feb-87 1437 RA ok for AX charges
Frank called to ask your ok to charge Sarah's roundtrip Boston-Lexington
tomorrow, $181.00. I gave him the ok, if it is not, please let me know and
I will call him.
Thanks,
∂24-Feb-87 1550 RA CS258
Can you give me the title of the course, because this number is not
listed in the catalog.
Thanks,
Rutie
-----
∂24-Feb-87 1739 guibas@decwrl.dec.com foundation search meetings
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 17:35:51 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Tue, 24 Feb 87 17:34:39 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA08172; Tue, 24 Feb 87 17:36:11 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA15456; Tue, 24 Feb 87 17:36:04 PST
Date: Tue, 24 Feb 87 17:36:04 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702250136.AA15456@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: foundation search meetings
i'd like to have two further meetings, one on friday, march 6, and the
second on friday, march 13 (bad omen?). the np-complete question is, can
we find a time that fits everybody? how is 2pm? 11am is bad for me.
we must try to make some decisions by the second of those two meetings,
as all the paperwork must be in to the school of engineering by april 15
for a fall appointment.
it'd be good if you could look over each candidate's file before your
interview with him, and if you ould send me a written evaluation shortly after
your session.
happy interviewing,
l.
∂24-Feb-87 2106 RIVIN@Score.Stanford.EDU Re: algebraic computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 21:06:04 PST
Date: Tue 24 Feb 87 21:01:42-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: Re: algebraic computation
To: NILSSON@Score.Stanford.EDU
cc: RIVIN@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
In-Reply-To: <12281677581.43.NILSSON@Score.Stanford.EDU>
Message-ID: <12281763468.12.RIVIN@Score.Stanford.EDU>
I'll produce a description shortly.
TNX,
Igor.
-------
∂24-Feb-87 2247 coraki!pratt@sun.com Mitchell talk
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Feb 87 22:47:46 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Tue, 24 Feb 87 22:46:31 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA04827; Tue, 24 Feb 87 22:42:49 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA27320; Tue, 24 Feb 87 22:47:31 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA16334; Tue, 24 Feb 87 22:21:38 PST
Date: Tue, 24 Feb 87 22:21:38 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8702250621.AA16334@coraki.uucp>
To: khoward@score.stanford.edu
Subject: Mitchell talk
Cc: fndsch@navajo.stanford.edu
Speaker: John Mitchell, Bell Labs
Date: March 10
Time: 10:00-11:00
Place: MJ352
Title: A Trade-Off Theorem in Programming Language Design
Abstract:
In the study of polymorphism and data abstraction, researchers
have identified ``strong'' and ``weak'' forms of each. The strong
forms are simpler to describe and use than the more restrictive
weak forms. We may safely combine strong polymorphism with weak data
abstraction, or vice versa, to produce useful programming languages.
However, combining strong polymorphism with strong data abstraction
produces a language with some strange and puzzling properties.
∂24-Feb-87 2248 coraki!pratt@Sun.COM re: Diagramming: An Educational Anachronism?
Received: from SUN.COM by SAIL.STANFORD.EDU with TCP; 24 Feb 87 22:48:03 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA04836; Tue, 24 Feb 87 22:43:41 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA27341; Tue, 24 Feb 87 22:48:23 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA16408; Tue, 24 Feb 87 22:41:25 PST
Date: Tue, 24 Feb 87 22:41:25 PST
From: coraki!pratt@Sun.COM (Vaughan Pratt)
Message-Id: <8702250641.AA16408@coraki.uucp>
To: John McCarthy <SAIL.STANFORD.EDU!JMC@Sun.COM>
Subject: re: Diagramming: An Educational Anachronism?
In-Reply-To: message of 24 Feb 87 1747 PST.
<8702250143.AA04103@Sun.COM>
I don't
see that the various forms of phrase structure grammar that
are being pushed differ from old-fashioned diagramming more
than the differ from each other.
Good point, maybe new math is worth more of a hassle than new
linguistics.
-v
∂25-Feb-87 0946 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Feb 27, 11:00
Place: 252 Margaret Jacks
Topic: Getting started on a Qlisp Manual
∂25-Feb-87 1047 KHOWARD@Score.Stanford.EDU message
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Feb 87 10:47:50 PST
Date: Wed 25 Feb 87 10:46:05-PST
From: Katherine Howard <KHOWARD@Score.Stanford.EDU>
Subject: message
To: jmc@Sail.Stanford.EDU
Message-ID: <12281913540.43.KHOWARD@Score.Stanford.EDU>
Hugo Bayona from the United States Information Agency in Washington, DC,
called. He says he's been trying to reach you for a week. He would like
you to call him at (202) 485-2734 about USIA programs overseas.
--Kathy
-------
∂25-Feb-87 1331 guibas@decwrl.dec.com time for the meetings
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Feb 87 13:31:11 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Wed, 25 Feb 87 13:29:38 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA17995; Wed, 25 Feb 87 13:31:10 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA10725; Wed, 25 Feb 87 13:31:04 PST
Date: Wed, 25 Feb 87 13:31:04 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8702252131.AA10725@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: time for the meetings
it seems from the messages you have sent me that late afternoon friday
will work best for everybody. so how about 4:30 pm? I think the meeting on
the 6-th should be short but cannot promise the same for the one on the
13th. perhaps that one should start a bit earlier (4:00 pm --vaughn, can
you make it?).
l.
∂25-Feb-87 1423 CLT ut
did you inquire about the academic schedule? or shall i send a msg
∂25-Feb-87 1501 NILSSON@Score.Stanford.EDU Annual Reports
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Feb 87 15:01:09 PST
Date: Wed 25 Feb 87 14:59:08-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Annual Reports
To: binford@Score.Stanford.EDU, buchanan@SUMEX-AIM.Stanford.EDU,
feigenbaum@SUMEX-AIM.Stanford.EDU, genesereth@SUMEX-AIM.Stanford.EDU,
zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU
cc: nilsson@Score.Stanford.EDU, kitz-miller@Sierra.Stanford.EDU
Message-ID: <12281959607.21.NILSSON@Score.Stanford.EDU>
Shari Austin-Kitzmiller, the person in the School of Engineering who
keeps track of such things for the Dean, informs me that the SOE has still
not received an academic year 1985-1986 "Annual Faculty Report" from you.
The School depends on these in many ways, not only as part of its
evaluation of departments but also bases its budget decisions and
budget requests on information in these reports. Since they are important,
I would appreciate your getting them in as soon as possible. (Anne
Richardson has hardcopy and online versions of the form. Online versions
can be send directly to Shari.) Thanks, -Nils
-------
∂25-Feb-87 1541 WINOGRAD@CSLI.Stanford.EDU CC of letter I sent to Spanish professor
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Feb 87 15:41:01 PST
Date: Wed 25 Feb 87 15:38:00-PST
From: Terry Winograd <WINOGRAD@CSLI.STANFORD.EDU>
Subject: CC of letter I sent to Spanish professor
To: nilsson@score,jmc@sail,buchanan@sumex
February 25, 1987
Prof. Rodolfo Fernandez Gonzalez
Urb. Retamar, 5, 4 A
28030 Las Rozas (Madrid)
Spain
Dear Prof. Fernandez Gonzalez,
With respect to your letter of Feburary 15, I am afraid I cannot be of
assistance in establishing a visit to Stanford. I will be on a
research leave during the 1987-88 academic year and it would not be
possible for me to organize a visit during that time. I see from your
letter that you have also written to professors Nilsson, Buchanan and
McCarthy (Prof. Lenat is now at MCC in Texas), and I hope they are able
to be more helpful.
Sincerely,
Terry Winograd
cc: Nilsson, McCarthy, Buchanan
∂25-Feb-87 1700 JMC
Yarim-Agaev
∂25-Feb-87 1833 ZM Re: Workshop
Dear John,
I would like to invite you to attend a joint US-Japan workshop on
"Logic of Programs"
sponsored jointly by NSF (US) and JSPS (Japan), to be held at the
East-West Center (Honolulu, Hawaii) on May 18-21, 1987.
The workshop is organized by Z. Manna (USA) and M. Sato (Japan).
There will be about 30 invitees from the US and from Japan.
Each invitee will be expected to give a 40-45 minute lecture.
A tentative list of invitees is enclosed.
The meeting will begin Monday morning, May 18, and continue through
Thursday afternoon, May 21. An afternoon tour, dining, and show in the
Polynesian Cultural Center are planned.
A block of rooms in the Kaimara Beach Hotel (on the beach at the foot of
Diamond Head) has been reserved -- $53 per night (single or double).
Ocean-front rooms will be available for $69 (single) and $72 (double),
but must be reserved well in advance.
To cover your expenses, a stipend of $1000 can be provided from workshop
funds.
Please respond quickly.
Best regards,
Zohar
US invitees (tentative list)
----------------------------
Prof. R. Boyer (University of Texas, Austin)
Prof. W. Bledsoe (MCC)
Dr. J. Halpern (IBM)
Prof. R. Constable (Cornell University)
Prof. D. Gries (Cornell University)
Dr. J-L. Lassez (IBM, Watson)
Prof. J. McCarthy (Stanford University)
Prof. Z. Manna (Stanford University)
Prof. A. Meyer (MIT)
Dr. F. Pereira (SRI International)
Prof. A. Robinson (Syracuse University)
Prof. D. Scott (CMU)
Dr. R. Waldinger (SRI International)
Japanese participants
---------------------
Dr. K. Furukawa (ICOT)
Mr. S. Goto (NTT)
Dr. S. Hayashi (Kyoto University)
Prof. T. Ito (Tohoku University)
Mr. Y. Kameyama (Tohoku University)
Dr. T. Kamimura (IBM)
Mr. T. Kanamori (Mitsubishi)
Prof. T. Katayama (Tokyo Institute of Technology)
Mr. T. Sakurai (Tokyo Metropolitan University)
Prof. M. Sato (Tohoku University)
Prof. S. Takasu (Kyoto University)
Dr. K. Ueda (ICOT)
Prof. A. Yonezawa (Tokyo Institute of Technology)
∂25-Feb-87 2220 ucscc!ucscd.beeson@ucbvax.Berkeley.EDU biblio. ref.
Received: from UCBVAX.Berkeley.EDU by SAIL.STANFORD.EDU with TCP; 25 Feb 87 22:20:00 PST
Received: by ucbvax.Berkeley.EDU (5.53/1.23)
id AA18622; Wed, 25 Feb 87 22:21:40 PST
Received: by ucscc (5.51/4.7)
id AA03118; Wed, 25 Feb 87 22:20:36 PST
Received: by ucscd (5.51/4.7)
id AA17755; Wed, 25 Feb 87 22:20:22 PST
Date: Wed, 25 Feb 87 22:20:22 PST
From: ucscc!beeson@ucscd.ucsc (20012000)
Message-Id: <8702260620.AA17755@ucscd>
To: jmc@sail.stanford.edu
Subject: biblio. ref.
At IJCAI 1985 in Karlsruhe you gave an invited talk, but no
corresponding paper appears in the proceedings, so I can't
refer to the paper when quoting you. Did you publish
your suggestions for creating a common-sense data base somewhere
else to which a proper reference can be given?
∂26-Feb-87 0024 ILAN@Score.Stanford.EDU re: Go programs
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Feb 87 00:24:50 PST
Date: Thu 26 Feb 87 00:23:19-PST
From: Ilan Vardi <ILAN@Score.Stanford.EDU>
Subject: re: Go programs
To: JMC@Sail.Stanford.EDU
cc: ilan@Score.Stanford.EDU, bchen@Sushi.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 25 Feb 87 23:22:00-PST
Message-ID: <12282062313.11.ILAN@Score.Stanford.EDU>
Brad Chen and I are thinking of starting a GO program. He's a CS
grad student, and I've written a paper about computer chess and have
thought a little about GO. It seems that GO is more amenable to parallelism
than chess because of the symmetry and because the rules are independent
of board size. We were wondering if one could write a program in q-lisp.
I pretty much think that one must start by programs on small boards
(6 by 6) and work up. I believe that people who try the 19 by 19 right
away are missing the point of GO vs Chess, though the opening in some
sense is similar to the endgame in Chess.
-Ilan
-------
∂26-Feb-87 0114 helen@Psych.Stanford.EDU Liberal biases
Received: from PSYCH.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Feb 87 01:14:33 PST
Received: by Psych.Stanford.EDU; Thu, 26 Feb 87 01:14:16 PST
Date: Thu, 26 Feb 87 01:14:16 PST
From: Helen Cunningham <helen@Psych.Stanford.EDU>
Subject: Liberal biases
To: jmc@sail.stanford.edu
Cc: helen@Psych.Stanford.EDU
I think it would be hard to support your claim that liberals
are more likely to "explain away" inconsistent data than are
conservatives. Really, are there data to this effect? I
would not be surprised if conservatives just don't bother
with data in the first place, if you include the religious
right as part of "conservatives". Anyway, insults aside, your
message suggests that you don't see any moral or societal value
in taking a careful stance on issues that can profoundly affect
the lives of human beings. That is, the public takes what
scientists say very uncritically. If a scientist lends support
to their existing prejudices, they may not be listening when
the scientific refutations get published...they may have already
taken irreversible action.
I think social scientists and educators are generally cautious
about making claims on the basis of inconclusive evidence, when
those claims could have negative affects on people's lives. I
this is justifiable concern. I am not saying that such people
condone LYING. There may be a bias these days toward finding
"avoidable" causes for social class, ethnic, and sex differences,
but this, in my view, is simply an optimistic attitude and does
no one any harm. And it redresses years of injustice that was
often rationalized by scientific and philosophical arguments.
The tone of many messages, including yours, seems to be one of
outrage, as if some injustice were being done by such a bias
(IF it exists; I'm not willing to say it does). I frankly don't
understand why someone in your position (or anyone here at Stanford)
should begrudge the oppressed of the world "the benefit of the doubt"
and these issues ARE in doubt, no question about that.
-helen
∂26-Feb-87 0727 COWER@CSLI.Stanford.EDU re: parking tickets
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Feb 87 07:27:07 PST
Date: Thu 26 Feb 87 07:26:32-PST
From: Rich Cower <COWER@CSLI.Stanford.EDU>
Subject: re: parking tickets
To: JMC@Sail.Stanford.EDU
cc: COWER@CSLI.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 25 Feb 87 19:46:00-PST
Message-ID: <12282139358.12.COWER@CSLI.Stanford.EDU>
I already stated I do. When the cop is in court, he is not out writing
tickets. Court is cheap theater, for the cost of a $12 parking ticket
(assuming you lose) you get to observe some really ridiculous things.
Given the tickets don't generally cost you anymore when you take them
to court, and it certainly costs the county/state/whatever more to
collect the fees in a courtroom situation - I absolutely believe in
taking them to court. It might help keep the system honest...
-------
∂26-Feb-87 0813 RA Re: Please phone
[Reply to message recvd: 25 Feb 87 17:45 Pacific Time]
I called the Greyhound terminal but they don't have the bag.
∂26-Feb-87 0900 JMC
camera for class
∂26-Feb-87 0900 JMC
susie
∂26-Feb-87 0958 CLT
tue 10-mar 19:00 Okner taxes
∂26-Feb-87 1009 RLG PhD programs
To: JMC@SAIL.STANFORD.EDU, VAL@SAIL.STANFORD.EDU,
schulz@SUSHI.STANFORD.EDU, j.jealous@LEAR.STANFORD.EDU
Stanford's CS PhD program admitted me this morning, according to Nils.
∂26-Feb-87 1140 VAL Reminder: Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
REPRESENTING DEFAULTS WITH EPISTEMIC CONCEPTS
Kurt Konolige, SRI International
Karen Myers, Stanford
Thursday, February 26, 4pm
Bldg. 160, Room 161K
Reasoning about defaults --- implications that typically hold,
but which may have exceptions --- is an important part of
commonsense reasoning. We present some parts of a theory of
defaults, concentrating on distinctions between various subtle
ways in which defaults can be defeated, and on the adjudication
of conflicting defaults under hierarchic inheritance. In order
to represent this theory in a formal system, it seems necessary
to use the epistemic concept of self-belief. We show how to
express the theory by an almost-local translation into
autoepistemic logic, which contains the requisite epistemic
operators. Just to be controversial, we also argue that
circumscription (pointwise, schematic, prioritized, or otherwise)
is insufficient for this task.
∂26-Feb-87 1533 RA leaving at 4:00
To: JMC, ZM
It's Thursday and I am leaving at 4:00
∂26-Feb-87 1536 MAYR@score.stanford.edu Joel Friedman's schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Feb 87 15:36:05 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 26 Feb 87 15:34:36 PST
Date: Thu 26 Feb 87 14:54:04-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Joel Friedman's schedule
To: fndsch@navajo.stanford.edu
Message-Id: <12282220830.51.MAYR@Score.Stanford.EDU>
Some of you have not yet signed up for Joel Friedman. This is another
appeal to do so. Please let me know when you'd like to talk with Joel.≠
Who: Joel Friedman, UC Berkeley
What: "On the Convergence of Newton's Method"
When: Wednesday, March 4, at 2:15pm
Where: MJH352
Please fill in the line below appropriate for you, and mail this message
back to me.
Schedule for Joel Friedman:
9:00- 9:30 Mayr MJH334
9:30-10:00
10:00-11:00 Guibas
11:00-11:30
11:30-12:00
12:00- 1:30 lunch at FC; Knuth
1:30- 2:00 Nilsson
2:00- 3:30 talk
3:30- 4:00 Pratt
4:00- 4:30 Oliger
4:30- 5:30 students
6:00- dinner
-------
∂26-Feb-87 2055 CLT please
plug in the vaporizer - make sure the cord is not tangled or
draped across the steam outlet.
also fire the dishwasher - add timothy's bowl after draining
thanks
∂27-Feb-87 0822 MAZZETTI@SUMEX-AIM.STANFORD.EDU lunch
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 08:22:21 PST
Date: Fri 27 Feb 87 08:21:23-PST
From: Claudia Mazzetti <MAZZETTI@SUMEX-AIM.STANFORD.EDU>
Subject: lunch
To: JMC@SAIL.STANFORD.EDU
cc: MAZZETTI@SUMEX-AIM.STANFORD.EDU
Message-ID: <12282411488.28.MAZZETTI@SUMEX-AIM.STANFORD.EDU>
John,
I've got a nasty case of the flu and will be unable to meet
for lunch today. Can we reschedule for next week? Any time
next week is OK with me.
Claudia
-------
∂27-Feb-87 0900 JMC
qlisp
∂27-Feb-87 0959 @Score.Stanford.EDU:WALESON@SUMEX-AIM.STANFORD.EDU AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 09:59:29 PST
Received: from SUMEX-AIM.STANFORD.EDU by SCORE.STANFORD.EDU with TCP; Fri 27 Feb 87 09:58:18-PST
Date: Fri 27 Feb 87 09:57:58-PST
From: Anthea Waleson <WALESON@SUMEX-AIM.STANFORD.EDU>
Subject: AI Planning Retreat
To: Binford@SCORE.STANFORD.EDU, bgb@SUMEX-AIM.STANFORD.EDU,
Feigenbaum@SUMEX-AIM.STANFORD.EDU, Genesereth@SUMEX-AIM.STANFORD.EDU,
McCarthy@SCORE.STANFORD.EDU, Nilsson@SCORE.STANFORD.EDU,
Rosenbloom@SUMEX-AIM.STANFORD.EDU, Winograd@SCORE.STANFORD.EDU
cc: waleson@SUMEX-AIM.STANFORD.EDU, haunga@SCORE.STANFORD.EDU,
puryear@SUMEX-AIM.STANFORD.EDU, Richardson@SCORE.STANFORD.EDU
Message-ID: <12282429071.39.WALESON@SUMEX-AIM.STANFORD.EDU>
This is to remind you that the AI Planning Retreat will take place
on Sunday, March 8th, from 9:30 a.m. to 4:30 p.m. at the Hidden
Villa hostel in Los Altos Hills. To reach Hidden Villa, go south
on Highway 280 to Los Altos and exit to the west on the El Monte/Moody
Road exit at Foothill College. Go west to stop sign, then bear left on
Moody Road for 2 miles. Enter the Hidden Villa gate on the left and
drive 1/4 mile to the Parking Field. The meeting will be held in
the Hostel building which is the first building on the left beyond
the parking field. I will put maps in I.D. mail. Please telephone
me at 3-0935 if you have questions
-------
∂27-Feb-87 1023 CLT ut reply
∂27-Feb-87 1021 yvo@sally.utexas.edu Re: Question
Received: from SALLY.UTEXAS.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 10:21:26 PST
Date: Fri, 27 Feb 87 11:56:50 CST
From: yvo@sally.utexas.edu (Yvonne Van Olphen)
Posted-Date: Fri, 27 Feb 87 11:56:50 CST
Message-Id: <8702271756.AA15490@sally.utexas.edu>
Received: by sally.utexas.edu (5.54/5.51)
id AA15490; Fri, 27 Feb 87 11:56:50 CST
To: CLT@sail.stanford.edu
Subject: Re: Question
Cc: ics.browne@r20.utexas.edu
Fall Semester 1987: September 1st through December 15th
Spring Semester 1988: January 18th through May 15th
Keep in mind, these dates are approximate--I didn't have the
exact dates available to me.
Let me know if I can be of further assistance to you.
-Yvonne Van Olphen
Dr. Browne's Secretary
∂27-Feb-87 1208 RA going home
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU, BS@SAIL.STANFORD.EDU
I don't feel well and am going home.
∂27-Feb-87 1402 NILSSON@Score.Stanford.EDU Re: AI Planning Retreat
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 14:01:53 PST
Date: Fri 27 Feb 87 13:50:47-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: Re: AI Planning Retreat
To: WALESON@SUMEX-AIM.Stanford.EDU
cc: Binford@Score.Stanford.EDU, bgb@SUMEX-AIM.Stanford.EDU,
Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
McCarthy@Score.Stanford.EDU, Rosenbloom@SUMEX-AIM.Stanford.EDU,
Winograd@Score.Stanford.EDU, haunga@Score.Stanford.EDU,
puryear@SUMEX-AIM.Stanford.EDU, Richardson@Score.Stanford.EDU,
NILSSON@Score.Stanford.EDU
In-Reply-To: <12282429071.39.WALESON@SUMEX-AIM.STANFORD.EDU>
Message-ID: <12282471454.37.NILSSON@Score.Stanford.EDU>
Regarding the AI faculty retreat: I will propose an agenda. If
you have suggested agenda items, pse forward to me. -Nils
-------
∂27-Feb-87 1457 VAL random fault
To: konolige@SRI-STRIPE.ARPA
CC: myers@SUSHI.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
SJG@SAIL.STANFORD.EDU, phayes@SRI-KL.ARPA,
grosof@SCORE.STANFORD.EDU
Kurt,
Here is an attempt to formalize your random fault example using
circumscription. I propose to express that the values of a function f
are random (in your sense) by the formula
not ab(x,y) implies f(x) equals y.
The random fault example is a special case in which the function in
question is propositional. To include this case, we reify truth values
and write
not ab(x,y) implies (P(x) iff (y equals true)).
Thus the axiom for the random fault predicate will be written as
randomfault(x) and not ab(x,y) implies (starts(x) iff (y equals true)).
Is this satisfactory?
Vladimir
∂27-Feb-87 1505 WENTWORTH@Sierra.Stanford.EDU Re: aids
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 15:05:46 PST
Date: Fri 27 Feb 87 15:03:02-PST
From: Robert Wentworth <WENTWORTH@Sierra.Stanford.EDU>
Subject: Re: aids
To: JMC@Sail.Stanford.EDU
cc: su-etc@Sierra.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 26 Feb 87 19:43:00-PST
Message-ID: <12282484607.47.WENTWORTH@Sierra.Stanford.EDU>
While I don't see much reason not to require AIDS testing prior to the
issuance of a marriage license, I don't think the issuing of the license
should be contingent on the outcome. The important thing is that the
potential spouse be informed, not that the marriage be prevented by law.
The distinction doesn't matter much in the case of syphillis, since it
can be cured prior to the issuing of the license. However, in the case
of AIDS one should probably simply require signatures from both parties
to the effect that they have been informed of test results. Obviously,
a lot of marriages won't end up happening if one parter tests positive,
but I don't think it's the state's role to decide.
-------
∂27-Feb-87 1517 JUTTA@Score.Stanford.EDU MS Admissions folders
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 15:17:15 PST
Date: Fri 27 Feb 87 15:16:05-PST
From: Jutta McCormick <JUTTA@Score.Stanford.EDU>
Subject: MS Admissions folders
To: ejm@Sierra.Stanford.EDU, jmc@Sail.Stanford.EDU
cc: jutta@Score.Stanford.EDU
Stanford-Phone: (415) 723-0572
Message-ID: <12282486982.14.JUTTA@Score.Stanford.EDU>
I am about to send you another batch of MS admissions folders and would
appreciate it if you evaluated and returned the folders I gave you two
weeks ago.
--Jutta McCormick
-------
-------
∂27-Feb-87 1521 VAL darpa proposal
Nils read our section of the proposal and suggested a few changes. Also he
believes that this should be sent to DARPA as another approximation, not as
the final version. He says we're going in the right direction, but still
what we have now may not be satisfactory in view of the current situation
at DARPA. Let's discuss his comments Monday (I'll be leaving Monday night
for two days).
∂27-Feb-87 1534 VAL elephant
Yuri Gurevich is interested in the idea of Elephant. Do you have anything
written on this subject that I can send him?
∂27-Feb-87 2059 OKUNO@SUMEX-AIM.STANFORD.EDU Abstract of Hibino's talk
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 20:59:19 PST
Date: Fri 27 Feb 87 20:58:03-PST
From: Hiroshi "Gitchang" Okuno <Okuno@SUMEX-AIM.STANFORD.EDU>
Subject: Abstract of Hibino's talk
To: clt@SAIL.STANFORD.EDU
cc: jmc@SAIL.STANFORD.EDU, okuno@SUMEX-AIM.STANFORD.EDU
Message-ID: <12282549233.30.OKUNO@SUMEX-AIM.STANFORD.EDU>
Carolyn,
This is an abstract of Mr. Hibino's talk.
Thanks for your arrangement.
- Gitchang -
--------------------
Title: VLSI approach to the ELIS Lisp machine
Speaker: Yasushi Hibino
Director of Second Research Section
NTT Basic Research Laboratories
Nippon Telegraph and Telephone
Abstract:
The LISP Machine ELIS was designed to achieve a comfortable
interactive programming environment by a fast microcoded LISP
interpreter. ELIS is a microprogram control machine with a 32k
64-bits-words writable control store. ELIS also has a 32K word
hardware stack and special memory interface registers. VLSI ELIS chip
is developed by two-micron double metal layer CMOS technology. The
VLSI ELIS is compatible with an ELIS breadboard machine in the level
of microcodes. Therefore, TAO Lisp, which is a dialect of CommonLisp
and assimilates object oriented programming, logic programming and
concurrent programming within the Lisp world, is running on the VLIS
ELIS. The speed of interpreted codes in TAO is comparable to that of
compiled codes of MIT's Lisp machines. THis good performance is
attained by a simple internal bus structure and a design of fucntion
blocks with iterative circuit structures.
In my talk, the architecture of ELIS is briefly introduced and a VLSI
approach for it is discussed. The approach is not like Meed and
Conway's. It is rather orthodox approach, because in the case of a
dedicated machine it is not desirable that VLSI design methodology
restricts an architecture of the machine.
-------
∂27-Feb-87 2113 OKUNO@SUMEX-AIM.STANFORD.EDU Your visit to Japan
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Feb 87 21:13:11 PST
Date: Fri 27 Feb 87 21:12:14-PST
From: Hiroshi "Gitchang" Okuno <Okuno@SUMEX-AIM.STANFORD.EDU>
Subject: Your visit to Japan
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12282551817.30.OKUNO@SUMEX-AIM.STANFORD.EDU>
John,
Thanks for arranging a seminar for Mr. Hibino. Today, I called Tak
and knew that you would visit ECL. It's a great fun of us. I would
like to suggest you that you would visit Riken (The Institute of
Physical and Chemical Research) to meet Dr. Sasaki to discuss on
parallel algorithm on Symbolic Manipulation. As you know, he is the
most active researchers in Symbolic Algebra in Japan and he developed
a BIGNUM package for REDUCE system when he stayed at Univ. of Utah. I
knew the name of Broebner basis by his papers. If necessary, I would
arrange your visit to Riken. More precisely, I'll ask Tak to arrange
it.
Have a nice trip,
- Gitchang -
-------
∂28-Feb-87 0702 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Re: Tokyo visits
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Feb 87 07:02:22 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Sat 28 Feb 87 06:59:23-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Sat 28 Feb 87 23:32:25
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Sat, 28 Feb 87 23:32:10 jst
Date: Sat, 28 Feb 87 23:32:10 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8702281432.AA09522@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20
In-Reply-To: John McCarthy's message of 25 Feb 87 0205 PST
Subject: Re: Tokyo visits
Ok, I will talk to Prof. Goto, and will let him know your visit.
∂28-Feb-87 1027 CLT Special seminar - VLSI and ELIS Lisp Machine
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU, aap@SUMEX-AIM.STANFORD.EDU,
pratt@NAVAJO.STANFORD.EDU, jlh@SONOMA.STANFORD.EDU,
su-events@SAIL.STANFORD.EDU
Title: VLSI approach to the ELIS Lisp machine
Speaker: Yasushi Hibino
Director of Second Research Section
NTT Basic Research Laboratories
Nippon Telegraph and Telephone
Time: Monday March 2, 3:30pm
Place: 352 Margaret Jacks
Abstract:
The LISP Machine ELIS was designed to achieve a comfortable
interactive programming environment by a fast microcoded LISP
interpreter. ELIS is a microprogram control machine with a 32k
64-bits-words writable control store. ELIS also has a 32K word
hardware stack and special memory interface registers. VLSI ELIS chip
is developed by two-micron double metal layer CMOS technology. The
VLSI ELIS is compatible with an ELIS breadboard machine in the level
of microcodes. Therefore, TAO Lisp, which is a dialect of CommonLisp
and assimilates object oriented programming, logic programming and
concurrent programming within the Lisp world, is running on the VLIS
ELIS. The speed of interpreted codes in TAO is comparable to that of
compiled codes of MIT's Lisp machines. THis good performance is
attained by a simple internal bus structure and a design of fucntion
blocks with iterative circuit structures.
In my talk, the architecture of ELIS is briefly introduced and a VLSI
approach for it is discussed. The approach is not like Meed and
Conway's. It is rather orthodox approach, because in the case of a
dedicated machine it is not desirable that VLSI design methodology
restricts an architecture of the machine.
[CLT -- Sorry for the short notice, please pass this on to anyone
you think might be interested.]
∂28-Feb-87 1548 WATSON@Sushi.Stanford.EDU Re: SJSU
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Feb 87 15:48:43 PST
Date: Sat 28 Feb 87 15:47:41-PST
From: Kennita L. Watson <WATSON@Sushi.Stanford.EDU>
Subject: Re: SJSU
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 26 Feb 87 19:13:00-PST
Message-ID: <12282754879.21.WATSON@Sushi.Stanford.EDU>
Thanks for the info. Unfortunately, I don't think my friend is prepared
to listen to reason on the subject, and is more in the mood for being
outraged at SJSU's undeserved (?) snubbing.
Kennita
←
-------
∂28-Feb-87 2327 helen@Psych.Stanford.EDU Re: sex differences and public policy
Received: from PSYCH.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Feb 87 23:27:33 PST
Received: by Psych.Stanford.EDU; Sat, 28 Feb 87 23:27:25 PST
Date: Sat, 28 Feb 87 23:27:25 PST
From: Helen Cunningham <helen@Psych.Stanford.EDU>
Subject: Re: sex differences and public policy
To: JMC@sail.stanford.edu, helen@psych.stanford.edu, su-etc@sail.stanford.edu
Cc: helen@Psych.Stanford.EDU
I think it was more of a "position" statement than anything
else. The item in SCIENCE was not a research report but a
news item. When I find it I'll provide the full text (it
was short).
-helen
∂01-Mar-87 0042 RFC Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 1 March 1987
Previous Balance 4.90
Monthly Interest at 1.0% 0.05
Current Charges 1.20 (coffee, tea and hot chocolate)
4.00 (bicycle lockers)
0.50 (vending machine)
-------
TOTAL AMOUNT DUE 10.65
Please deliver payments to Debbie Woodward, room 040, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Note: Payment recordation takes up to three weeks after delivery of a payment
(but not beyond the next billing date).
Bills are payable upon presentation. Interest of 1.0% per month will be
charged on balances remaining unpaid 25 days after bill date above.
An account with a credit balance earns interest of .33% per month,
based on the average daily balance.
Your last Pony payment was recorded on 1/17/87.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂01-Mar-87 0900 JMC
elephant
∂01-Mar-87 0900 JMC
logic
∂01-Mar-87 1135 NILSSON@Score.Stanford.EDU
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Mar 87 11:35:22 PST
Date: Sun 1 Mar 87 11:32:08-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
To: Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
WINOGRAD@CSLI.Stanford.EDU, JMC@Sail.Stanford.EDU,
Rosenbloom@SUMEX-AIM.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
TOB@Sail.Stanford.EDU, Shortliffe@SUMEX-AIM.Stanford.EDU
cc: hirsh@SUMEX-AIM.Stanford.EDU, duran@Sushi.Stanford.EDU
Message-ID: <12282970500.18.NILSSON@Score.Stanford.EDU>
Here are some topics for our ai retreat that have already
been suggested. Additional suggestions to Nilsson.
Proposed Agenda for AI Faculty Retreat
March 8, 1987
9:30 am - 4:30 pm
Quals
Ph.D. Research
Advising
Funding
Curriculum
Possible Integrated AI Research Proposal
Who are the AI Faculty?
New AI Faculty?
New CSD Building
-------
∂01-Mar-87 1307 HANSEN@Sierra.Stanford.EDU Breakin to your account on ibmrtpc1.
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Mar 87 13:07:32 PST
Date: Sun 1 Mar 87 13:05:03-PST
From: Stephen Hansen <Hansen@Sierra.Stanford.EDU>
Subject: Breakin to your account on ibmrtpc1.
To: jmc@Sail.Stanford.EDU
Message-ID: <12282987415.17.HANSEN@Sierra.Stanford.EDU>
I am sorry for the delay in getting this to you but the host table on
Talbots (my prefered address) doesn't know about sail's new address
and the MAILER-DEAMON just now bounced it back to me. I also tried
calling you friday but there was no answer.
A cracker that I have been monitoring accessed your account on ibmrtpc1
just before midnight on the 26th. The police are already on this case
as this person has been doing damage to several other on campus systems.
I am sending you an extract of my log file that shows just what was done
on the rt.
This person does have a reasonable amount of competance when it comes
to building trapdoors into a system so I would suggest that you survey
you file system carefully for any modifications. I can only monitor
this persons activities on a few systems so I can't tell if he came in
at other times directly from a tip or other system. Last night he was
using tip-mjhe line 15.
There is an investigation in progress and I would appreciate it if you
kept this information as confidential as possible.
If you have any questions please call me at x3-1058.
Stephen Hansen
ps. Considering the delay in getting this information to you please
feel free to call me at home (493-2095) if you think it necessary.
-------
∂01-Mar-87 1308 HANSEN@Sierra.Stanford.EDU Log of breakin on ibmrtpc1
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Mar 87 13:07:59 PST
Date: Sun 1 Mar 87 13:05:30-PST
From: Stephen Hansen <Hansen@Sierra.Stanford.EDU>
Subject: Log of breakin on ibmrtpc1
To: jmc@Sail.Stanford.EDU
Message-ID: <12282987496.17.HANSEN@Sierra.Stanford.EDU>
tftp> c ibmrtpc1
tftp> get /etc/passwd p
Received 1196 bytes in 5 seconds.
tftp> q
%grep :: p
shutdown::0:0:System killer:/:/usr/local/etc/shutdown
les::10:10:Les Earnest:/usr/les:/bin/csh
jmc::11:10:John McCarthy:/usr/jmc:/bin/csh
clt::13:10:Carolyn Talcott:/usr/clt:/bin/csh
test::99:31:DTN test login:/:/usr/ucb/yes
%finger les@ibmrtpc1
[ibmrtpc1] connect: Connection refused
%rusers ibmrtpc1
↑C%telnet ibmrtpc1
Trying 36.8.0.111 ...
Connected to ibmrtpc1.
Escape character is '↑]'.
4.3 BSD UNIX (ibmrtpc1)
login: jmc
Last login: Fri Sep 12 00:19:54 from su-ai.arpa
4.2 BSD UNIX (GENERIC) #2: Mon Sep 22 14:57:20 PDT 1986
IBM Academic Information Systems 4.2
5799-CGZ (C) Copyright IBM Corporation 1986
All Rights Reserved
Licensed Materials - Property of IBM
% w
w: No namelist
% who
air console Feb 2 21:29
jmc ttyp0 Feb 4 06:45 (36.14.0.11)
% finger air
Login name: air In real life: Arkady Rabinov
Directory: /user/air Shell: /bin/csh
On since Feb 2 21:29:02 on console 8 hours 31 minutes Idle Time
No Plan.
% ls -a
. .cshrc .login alt.c alt.h alt.o test
.. .history alt alt.data alt.lsp mbox
% mail
No mail for jmc
% stty
new tty, speed 38400 baud; -tabs crt
% stty erase "↑h" intr "↑c" kil "↑u"
unknown mode: kil
unknown mode: ↑u
% stty kill "↑u"
% stty
new tty, speed 38400 baud; -tabs crt
% ls -al
total 15
drwxr-xr-x 2 jmc 512 May 21 1986 .
drwxrwxr-x 37 root 1024 Feb 3 00:03 ..
-rw-r--r-- 1 jmc 130 Feb 24 1986 .cshrc
-rwxr-xr-x 1 jmc 407 Sep 12 00:20 .history
-rw-r--r-- 1 jmc 104 May 1 1986 .login
-rw-r--r-- 1 jmc 82 May 3 1986 alt
-rw-r--r-- 1 jmc 743 May 3 1986 alt.c
-rw-r--r-- 1 jmc 20 May 3 1986 alt.data
-rw-r--r-- 1 jmc 135 May 3 1986 alt.h
-rw-r--r-- 1 jmc 82 May 3 1986 alt.lsp
-rw-r--r-- 1 jmc 2314 May 3 1986 alt.o
-rw------- 1 jmc 938 Mar 26 1986 mbox
-rw-r--r-- 1 jmc 5 Apr 3 1986 test
% cat .cshrc
set path = ( /etc /usr/ucb /bin /usr/bin . /usr/local /usr/ibmtools /usr/new )
set history = 50
set savehist = 50
alias j jobs -l
% cat .login
umask 2
alias k logout
stty new crt erase ↑H kill ↑U intr ↑C -nl
alias kcl /usr/kcl/okcl/unixport/kcl
%
% cat .profile
.profile: No such file or directory
% cat .logout
.logout: No such file or directory
% file *
alt: ascii text
alt.c: c program text
alt.data: ascii text
alt.h: ascii text
alt.lsp: ascii text
alt.o: executable not stripped
mbox: ascii text
test: ascii text
% more test
test
% cat test
test
% rm test
% more mbox
>From greep Wed Mar 26 23:44:56 1986
Received: by with Sendmail; Wed, 26 Mar 86 23:44:52 pst
Date: Wed, 26 Mar 86 23:44:52 pst
From: Steven Tepper <greep>
To: jmc
Status: RO
You can type "ps xg" to get the process id of your shell (not the
one you're logged into now! -- check tye TTY number) and then
type "kill -9 nn" where nn is the process id.
>From JMC@SU-AI.ARPA Wed Mar 26 22:30:11 1986
Received: from SU-AI.ARPA (su-ai.arpa.ARPA) by ibmpcrt1 (4.12/4.7)
id AA01379; Wed, 26 Mar 86 22:30:07 pst
Message-Id: <8603270630.AA01379@ibmpcrt1>
Date: 26 Mar 86 2229 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: jmc@IBMPCRT1
Status: RO
test
>From JMC@SU-AI.ARPA Wed Mar 26 13:21:30 1986
Received: from SU-AI.ARPA (su-ai.arpa.ARPA) by ibmpcrt1 (4.12/4.7)
id AA00169; Wed, 26 Mar 86 13:21:26 pst
Message-Id: <8603262121.AA00169@ibmpcrt1>
Date: 26 Mar 86 1320 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: jmc@IBMPCRT1
Status: RO
test
% more alt
(defun alt (u) (if (or (null u) (null (cdr u))) u (cons (car u) (alt (cddr u))))
)
% rm mbox
% ls
alt alt.c alt.data alt.h alt.lsp alt.o
% rm *
% ls -a
. .. .cshrc .history .login
% cat .history
ls
k
cat .login
cat foo
cat > foo
cat foo
cat foo .login > foo1
cat foo1
cat > foo2
cat .login foo2 > foo1
cat foo1
mv foo1 .login
cat .login
rm foo foo1 foo2
k
kcl
kcl
inger
finger
cat
cat alt
cat > alt
cat alt
kcl
k
kcl
ls
cat alt > alt.lsp
ls
kcl
ls
cat alt.c
cat alt.o
ls -ls
cat alt.lsp
cat alt.c
k
finger
k
finger
k
finger
k
kcl
k
finger
k
finger
k
k
% ls -al
total 5
drwxr-xr-x 2 jmc 512 Feb 4 06:50 .
drwxrwxr-x 37 root 1024 Feb 3 00:03 ..
-rw-r--r-- 1 jmc 130 Feb 24 1986 .cshrc
-rwxr-xr-x 1 jmc 407 Sep 12 00:20 .history
-rw-r--r-- 1 jmc 104 May 1 1986 .login
% rm .history
% umask
2
% umask 0
% cat>a
test
%Dls -l a
-rw-rw-rw- 1 jmc 5 Feb 4 06:51 a
% umask 000
% cat>a
test
%Dls -l a
-rw-rw-rw- 1 jmc 5 Feb 4 06:52 a
% umask 77
% rm a
% ls -l /etc/passwd
-rw-r--r-- 1 root 1196 Oct 20 22:54 /etc/passwd
% cat /etc/group
wheel:*:0:root
daemon:*:1:daemon
staff:*:10:root,ibmacis
operator:*:28:root
guest:*:31:root
kcl:*:32:dan
fol:*:33:dan,kcl
ibmacis:*:100:
% ls /etc/phones
/etc/phones not found
% ls -lt/etc/hosts
-rw-r--r-- 1 root 213491 Aug 26 17:18 /etc/hosts
% ls -l /etc/hosts.equiv
-rw-r--r-- 1 root 0 Mar 17 1986 /etc/hosts.equiv
% uname
uname: Command not found.
% uuname
uuname: Command not found.
% ls -a /usr/adm
. acct-pp lpd-errs newsyslog savacct wtmp
.. lastlog messages rlpacct shutdownlog
acct lpacct msgbuf rlpd-errs usracct
% ls -l /usr/adm/acct-pp
-rw-r--r-- 1 root 0 Mar 17 1986 /usr/adm/acct-pp
% ls -l /etcvwtmp
/etcvwtmp not found
% ls -l /etc/$[1mwtm$[mp
/etc/wtmp not found
% ls -l /usr/adm/wtmp
-rw-rw-rw- 1 root 77400 Feb 4 06:45 /usr/adm/wtmp
% file /us$[1mr/a$[mdm/wtmp
/usr/adm/wtmp: data
% ls -a /
. dev march31
.. etc mnt
.cshrc install_done modified.since.march31
.history install_notes nfaccess
.login install_sendapar sys
.profile install_ttys tmp
.rhosts install_uucp user
backroot lib usr
bin lost+found vmunix.std
boot make.clean
% cd /
% cat .cshrc
set path = ( /etc /usr/ucb /bin /usr/bin . /usr/local /usr/ibmtools /usr/new )
set history = 50
set savehist = 50
alias j jobs -l
% cat .login
umask 2
stty new crt erase ↑H kill ↑U intr ↑C -nl
echo "Don't login as root, use su"
% cat .profile
stty new crt erase \↑H kill \↑U intr \↑C -nl
echo 'erase ↑H, kill ↑U, intr ↑C'
PS1=`hostname`'# '; export PS1
PATH=/etc:/usr/ucb:/bin:/usr/bin:/usr/local:/usr/ibmtools:/usr/new
export PATH
HOME=/
export HOME
TERM=${TERM-ibmconsole}
export TERM
% cat .history
rm x*
exit
pwd
gnu
cd /user/gnuemacs/src
gnu
exit
chmod a+w swapgeneric.c
exit
mkdir safe
mv vmunix safe
ls .. -a
ls -a ..
ls -l ..
chown air /sys/IBMRTPC1
exit
pwd
chown air *
exit
chown air ../h/*
exit
pwd
cd ../cacons
chown air *
exit
pwd
rm -r andrew
exit
chown air vm*
ls -l vm*
exit
pwd
rm *
ls
exit
rm GENERIC/*
ls -l GENERIC/tmp
rm GENERIC/tmp/*
ls
rmdir GENERIC
rmdir GENERIC/tmp
rmdir GENERIC
du
rmdir ca
ls -l
rm *
ls -l h
rm h/*
rmdir h
exit
% finger root
Login name: root In real life: Charlie Root
Directory: / Shell: /bin/csh
Last login Mon Feb 2 16:52 on console
No Plan.
% cat .rhosts
% ls /usr/lib/uucp
L-devices L.cmds SEQF uucico uucp
L-dialcodes L.sys USERFILE uuclean uuxqt
% cd /usr/lib/uucp
% ls -l L.sys
-rw-r----- 1 uucp 131 Sep 30 1985 L.sys
% cd /usr/lib
% ls -l cron*
-rwxr-xr-x 1 root 594 May 13 1986 crontab
-r--r--r-- 1 root 661 May 13 1986 crontab.orig
% cat crontab
30 4 * * * /etc/sa -s > /dev/null
0 4 * * * calendar -
15 4 * * * find /usr/preserve -mtime +7 -a -exec rm -f {} \;
20 4 * * * find /usr/msgs -mtime +21 -a ! -perm 444 -a ! -name bounds -a -exec r
m -f {} \;
30 4 * * * /usr/lib/uucp/cleanlog
40 4 * * * find / '(' -name '#*' -o -name '*.CKP' ')' -a -atime +3 -a -exec rm -
f {} ';'
0,15,30,45 * * * * /usr/lib/atrun
0,10,20,30,40,50 * * * * /etc/dmesg - >>/usr/adm/messages
0 0 * * * su daemon < /usr/local/lib/uucp.daily
0 5,12,18 * * * su daemon < /usr/local/lib/uucp.6hours
0 0 * * * /usr/local/lib/news/expire
5 4 * * * sh /usr/adm/newsyslog
% ls -l /usr/adm/newsyslog
-rwxr-xr-x 1 daemon 279 Mar 16 1986 /usr/adm/newsyslog
% file /usr/adm/newsyslog
/usr/adm/newsyslog: commands text
% cat /usr/$[1madm/$[mnewsyslog
cd /usr/spool/mqueue
rm syslog.7
mv syslog.6 syslog.7
mv syslog.5 syslog.6
mv syslog.4 syslog.5
mv syslog.3 syslog.4
mv syslog.2 syslog.3
mv syslog.1 syslog.2
mv syslog.0 syslog.1
mv syslog syslog.0
cp /dev/null syslog
chmod 666 syslog
kill -1 `cat /etc/syslog.pid`
% pwd
/usr/lib
% cd uucp
% ls cleanlog
cleanlog not found
% ls -l ../cleanlog
../cleanlog not found
% cd /usr/spool
% ls
at lpd lplpd mqueue ppd rppd
imlpd lpd.lock mail notes rlpd rwho
% cd mail
% ls
clt kcl khanna yoram
% ls -l
total 2
-rw------- 1 clt 1170 Sep 24 13:01 clt
-rw------- 1 kcl 0 Sep 25 16:29 kcl
-rw------- 1 khanna 0 Jul 14 1986 khanna
-rw------- 1 yoram 0 Oct 4 00:05 yoram
% cd /
% pwd
/usr/jmc
% cd /usr
% ls
Adds edu ibmrtpc1 les new stanford
adm games ibmtools lib preserve sys
bin greep include local pub tmp
clt grt.bug jmc lost+found skel ucb
dan guest kcl man spool weening
dict hosts khanna mdec src
doc ibm ldir msgs stand
% finger les
Login name: les In real life: Les Earnest
Directory: /usr/les Shell: /bin/csh
Last login Wed Oct 15 12:07 on ttyp0
No Plan.
% finger clt
Login name: clt In real life: Carolyn Talcott
Directory: /usr/clt Shell: /bin/csh
Last login Wed Sep 24 12:42 on ttyp0
No Plan.
% ls /user
air dan fol greep lost+found usr
cmu edward gnuemacs kcl src yoram
% grep clt /etc/passwd
clt::13:10:Carolyn Talcott:/usr/clt:/bin/csh
% grep les /etc/passwd
les::10:10:Les Earnest:/usr/les:/bin/csh
% grep jmc /etc/passwd
jmc::11:10:John McCarthy:/usr/jmc:/bin/csh
% passwd
Changing password for jmc
New password:
Retype new password:
% who
air console Feb 2 21:29
jmc ttyp0 Feb 4 06:45 (36.14.0.11)
% rusers
rusers: Command not found.
% telnet
telnet> q
% rwho
% find / -name '.netrc' -print > netrc &
[1] 2555
% pwd
/usr
% cd
% $[1mls$[m -a
% ls /usr/netrc
/usr/netrc
% kill 2555
% rm /usr/netrc
[1] + Terminated find / -name .netrc -print > netrc
% find / -name '.netrc' -print > netrc &
[1] 2562
% find / -name '.rhosts' -print > rhosts &
[2] 2565
% find / -perm -4000 -user root -print > perm &
[3] 2568
% ps
/vmunix: No namelist
% ls /tmp
lost+found sys
% finger
Login Name TTY Idle When Office
air Arkady Rabinov co 8:51 Mon 21:29
jmc John McCarthy p0 Wed 06:45
% cu
usage: cu telno [-t] [-s speed] [-a acu] [-l line] [-#]
% ls
netrc perm rhosts
% ls -l
total 0
-rw------- 1 jmc 0 Feb 4 07:04 netrc
-rw------- 1 jmc 0 Feb 4 07:05 perm
-rw------- 1 jmc 0 Feb 4 07:05 rhosts
% fin$[1mg$[mer jmc@portia
Login name: jmc@portia In real life: ???
% telnet portia 79
Trying...
Connected to portia.
Escape character is '↑]'.
jmc
Login name: jmc In real life: ???
Connection closed by foreign host.
% telnet portia 79
Trying...
Connected to portia.
Escape character is '↑]'.
les
Login name: les In real life: ???
Connection closed by foreign host.
[1] Done find / -name .netrc -print > netrc
% ls -l
total 1
-rw------- 1 jmc 0 Feb 4 07:04 netrc
-rw------- 1 jmc 0 Feb 4 07:05 perm
-rw------- 1 jmc 107 Feb 4 07:08 rhosts
[2] - Done find / -name .rhosts -print > rhosts
% tftp portia
tftp> get /etc/passwd p
Error code 2: Access violation
tftp> q
[3] + Done find / -perm -4000 -user root -print > perm
% ls -l
total 2
-rw------- 1 jmc 0 Feb 4 07:04 netrc
-rw------- 1 jmc 0 Feb 4 07:09 p
-rw------- 1 jmc 517 Feb 4 07:09 perm
-rw------- 1 jmc 107 Feb 4 07:08 rhosts
% rm netrc p
% cat rhosts
/usr/src/root/.rhosts
/usr/les/.rhosts
/usr/greep/.rhosts
/usr/ibmrtpc1/.rhosts
/user/air/.rhosts
/.rhosts
% cat perm
/bin/chgrp
/bin/df
/bin/login
/bin/mail
/bin/passwd
/bin/su
/usr/lib/ex3.7recover
/usr/lib/ex3.7preserve
/usr/lib/sendmail
/usr/lib/lpd
/usr/ucb/chfn
/usr/ucb/chsh
/usr/ucb/rcp
/usr/ucb/rsh
/usr/ucb/quota
/usr/ucb/lpr
/usr/ucb/lpq
/usr/ucb/lprm
/usr/ucb/rlogin
/usr/ucb/rdist
/usr/ldir/etc/rrestore
/user/usr/ucb/chfn
/user/usr/ucb/chsh
/user/usr/ucb/rcp
/user/usr/ucb/rsh
/user/usr/ucb/quota
/user/usr/ucb/lpr
/user/usr/ucb/lpq
/user/usr/ucb/lprm
/user/usr/ucb/rlogin
/user/usr/ucb/rdist
/user/usr/ldir/etc/rrestore
% man rdist
RDIST(1) UNIX Programmer's Manual RDIST(1)
NAME
rdist - remote file distribution program
SYNOPSIS
rdist [ -DnqbRvwyhi ] [ -f distfile ] [ -d var=value ] [
name ... ]
rdist [ -DnqbRvwyhi ] -c name ... host[.login][:dest]
DESCRIPTION
Rdist is a program to maintain identical copies of files
over multiple hosts. It preserves the owner, group, mode,
and mtime of files if possible and can update programs that
are executing. Rdist reads commands from distfile to direct
the updating of files and/or directories. If distfile is
`-', the standard input is used. If no -f option is
present, the file `distfile' is used for input. If no names
are specified on the command line, rdist will update all of
the files and directories listed in distfile. Otherwise,
% ls -l
total 2
-rw------- 1 jmc 517 Feb 4 07:09 perm
-rw------- 1 jmc 107 Feb 4 07:08 rhosts
% ls -al
total 6
drwxr-xr-x 2 jmc 512 Feb 4 07:10 .
drwxrwxr-x 37 root 1024 Feb 4 07:04 ..
-rw-r--r-- 1 jmc 130 Feb 24 1986 .cshrc
-rw-r--r-- 1 jmc 104 May 1 1986 .login
-rw------- 1 jmc 517 Feb 4 07:09 perm
-rw------- 1 jmc 107 Feb 4 07:08 rhosts
% tftp irisrt8c
irisrt8: unknown host
tftp> tftp> status
Not connected.
Mode: netascii Verbose: off Tracing: off
Rexmt-interval: 5 seconds, Max-timeout: 25 seconds
tftp> q
% rusers
rusers: Command not found.
% rwho cobra
% rlogin cobra
cobra: unknown host
% rlogin cobra.stanford.edu
cobra.stanford.edu: unknown host
% logout
Connection closed by foreign host.
-------
∂01-Mar-87 1407 HANSEN@Sierra.Stanford.EDU re: Breakin to your account on ibmrtpc1.
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 1 Mar 87 14:07:12 PST
Date: Sun 1 Mar 87 14:04:40-PST
From: Stephen Hansen <Hansen@Sierra.Stanford.EDU>
Subject: re: Breakin to your account on ibmrtpc1.
To: JMC@Sail.Stanford.EDU
cc: Hansen@Sierra.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 1 Mar 87 14:02:00-PST
Message-ID: <12282998269.17.HANSEN@Sierra.Stanford.EDU>
I have been on the phone for a while. I you have been trying to call
me you might try again now. 723-1058
seh
-------
∂01-Mar-87 1429 VAL re: proposal
[In reply to message rcvd 28-Feb-87 14:20-PT.]
I must be leaving for the airport at 11am Monday. Can we meet at 10?
(I'll be back Thursday, hopefully in time for the seminar.)
∂01-Mar-87 1440 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
REPRESENTING DEFAULTS WITH EPISTEMIC CONCEPTS: Part 2
Kurt Konolige, SRI International
Karen Myers, Stanford
Thursday, March 5, 4pm
Bldg. 160, Room 161K
Kurt will start with reviewing the main points of the last seminar,
so that Part 2 will be essentially self-contained.
∂01-Mar-87 2224 RWF reply to message
[In reply to message rcvd 27-Feb-87 18:08-PT.]
Thanks. I realized through your example that (apparently) editing into the
bboard shut even readers out. Or am I wrong about that? Eg, if I use the
SAIL REPLY macro, am I locking readers out?
-Bob
∂02-Mar-87 1057 bleiberg@argus.stanford.edu Re: whois database
Received: from ARGUS.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Mar 87 10:57:47 PST
Received: by argus.stanford.edu; Mon, 2 Mar 87 10:57:39 PST
Date: 2 Mar 1987 1057-PST (Monday)
From: Abraham Bleiberg <bleiberg@argus.stanford.edu>
To: John McCarthy <JMC@sail.stanford.edu>
Cc: bleiberg@argus.stanford.edu
Subject: Re: whois database
In-Reply-To: John McCarthy <JMC@SAIL.STANFORD.EDU> /
02 Mar 87 1018 PST.
As I said in my previous message to nethax, the data comes from the
faculty/staff directory at ITS. The idea is to update it as much as we
can and pass the changes to them.
Abraham
∂02-Mar-87 1337 WEGMAN@yktvmh2.bitnet Visit
Received: from LINDY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Mar 87 13:37:36 PST
Received: by lindy.STANFORD.EDU; Mon, 2 Mar 87 13:35:37 PST
Date: Mon, 2 Mar 87 13:37:12 PST
From: <WEGMAN@yktvmh2.bitnet>
Reply-To: WEGMAN%YKTVMH2.BITNET@forsythe.stanford.edu
To: JMC@sail.stanford.edu
Subject: Visit
Date: 2 Mar 1987 16:36:10-EST (Monday)
From: WEGMAN@YKTVMH2
To: JMC@SAIL.STANFORD.EDU
Subject: Visit
Good. Look forward to seeing you then.
∂02-Mar-87 1346 CERF@A.ISI.EDU NAE
Received: from A.ISI.EDU by SAIL.STANFORD.EDU with TCP; 2 Mar 87 13:46:46 PST
Date: 2 Mar 1987 16:46-EST
Sender: CERF@A.ISI.EDU
Subject: NAE
From: CERF@A.ISI.EDU
To: jmc@SAIL.STANFORD.EDU
Message-ID: <[A.ISI.EDU] 2-Mar-87 16:46:17.CERF>
Dear John,
Congratulations on your elevation to membership in the National Academy
of Engineering. This is a well-deserved honor, especially considering
your recent contributions towards recognizing the importance of
knowledge in machinable form. I hope that this additional recognition
of your stature in the community will provide you the opportunity to
make progress along the lines of your discussions with NRI in the
recent past.
Best wishes,
Vint
∂02-Mar-87 1355 CLT
To: CLT, JMC
browne 512-471-1901
∂02-Mar-87 1547 KONOLIGE@SRI-WARBUCKS.ARPA Re: random fault
Received: from SRI-WARBUCKS.ARPA by SAIL.STANFORD.EDU with TCP; 2 Mar 87 15:46:14 PST
Date: Mon 2 Mar 87 15:46:36-PST
From: Kurt Konolige <KONOLIGE@SRI-WARBUCKS.ARPA>
Subject: Re: random fault
To: VAL@SAIL.STANFORD.EDU
Cc: konolige@SRI-STRIPE.ARPA, myers@SUSHI.STANFORD.EDU,
JMC@SAIL.STANFORD.EDU, SJG@SAIL.STANFORD.EDU, phayes@SRI-KL.ARPA,
grosof@SCORE.STANFORD.EDU
Message-ID: <VAX-MM(196)+TOPSLIB(126)+PONY(124) 2-Mar-87 15:46:36.SRI-WARBUCKS.ARPA>
In-Reply-To: Message from "Vladimir Lifschitz <VAL@SAIL.STANFORD.EDU>"
of 27 Feb 87 1457 PST
Vladimir, your solution works if minimizing ab(x,y) is given
higher priority than the other ab's, because there are (at least) two
minimal models, one in which starts(x) is true, and the other false.
In a sense it involves intentional objects, because the truthvalue of
starts(x) is made dependent on identity of an individual.
--kk
-------
∂02-Mar-87 1632 @po3.andrew.cmu.edu:lb0q#@andrew.cmu.edu AAAI workshop funding
Received: from PO3.ANDREW.CMU.EDU by SAIL.STANFORD.EDU with TCP; 2 Mar 87 16:32:15 PST
Received: by po3.andrew.cmu.edu (4.12/3.15) id <AB00524> for jmc@su-ai.arpa; Mon, 2 Mar 87 19:33:50 est
Received: via switchmail; Mon, 2 Mar 87 19:33:36 est
Received: FROM catawissa VIA queuemail
ID </cmu/common/mailqs/q000/QF.catawissa.204a24c9.3aa>;
Mon, 2 Mar 87 19:33:23 est
Message-Id: <MS.V3.18.lb0q.80022d03.catawissa.ibm032.2665.0@andrew.cmu.edu>
Date: Mon, 2 Mar 87 19:32:55 est
From: lb0q#@andrew.cmu.edu (Leslie Burkholder)
To: jmc@su-ai.arpa
Subject: AAAI workshop funding
I understand that AAAI has funds available to support workshops.
I'd like to know how to apply.
We would like to organize a workshop on automated production of "natural"
natural deductions. The workshop should involve people in math, cs, and
philosophy depts. If possible, we'd like to hold it in conjunction with a
computers and philosophy conference being held this June. If that's not
possible, we would like to aim for the fall of this year.
Leslie Burkholder
Research Scientist
Center for Design of Educational Computing
Carnegie Mellon University
∂02-Mar-87 1818 Mailer failed mail returned
To: JMC
In processing the following command:
MAIL
The following message was aborted because of a command error,
namely, nonexistent recipient(s):
lb0q
------- Begin undelivered message: -------
∂02-Mar-87 1818 JMC #@andrew.cmu.edu
re: AAAI workshop funding
[In reply to message sent Mon, 2 Mar 87 19:32:55 est.]
Workshops in AI sponsored by AAAI.
AAAI will sponsor workshops in particular areas of AI. So far more
than 15 have been sponsored. The format is not prescribed except that
this program does not sponsor large conferences.
Here are some policies.
1. Up to $10K can be approved per workshop.
2. No honoraria for speakers or overhead to institutions will be paid.
3. Proposals should be sent to
John McCarthy.
4. Electronic mail to JMC@SU-AI.STANFORD.EDU is preferred, but U.S.
mail to
Professor John McCarthy
Computer Science Department
Stanford, CA 94305
will also work. If you get impatient you can phone (415)723-4430.
5. Proposals should contain approximations to the following:
a. budget.
b. subject, detailed enough to evaluate relevance to AI
and possible overlap with other workshop proposals.
c. conditions of participation including how papers
and attendees are to be selected.
d. when and where if this is known.
6. Correspondence should be copied to AAAI-OFFICE@SUMEX.STANFORD.EDU
or to
Ms. Claudia Mazzetti, Executive Director
AAAI
445 Burgess St.
Menlo Park, CA 94025
You can phone her at (415)328-3123.
7. After McCarthy has approved the proposal further arrangements should
be made with Mazzetti at the AAAI office. This includes transfer of
money and possible help with publicity and workshop preprints and
publication.
8. After the workshop is finished there should be a report suitable
for publication in AI Magazine.
------- End undelivered message -------
∂02-Mar-87 1820 LES re: nic database
[In reply to message rcvd 02-Mar-87 15:20-PT.]
Er, ah . . . I guess that is one of my jobs -- I'll get it fixed.
Did you get that Pub file to compile?
∂02-Mar-87 2159 guibas@navajo.stanford.edu foundations search meetings: when and where
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 2 Mar 87 21:59:15 PST
Received: by navajo.stanford.edu; Mon, 2 Mar 87 21:57:45 PST
Date: 2 Mar 1987 2157-PST (Monday)
From: Leonidas Guibas <guibas@navajo.stanford.edu>
To: fndsch@navajo.stanford.edu
Cc: guibas@navajo.stanford.edu
Subject: foundations search meetings: when and where
Friday March 6 4:30 to 6:00 MJH 252
Friday March 13 4:30 to 6:00 MJH 301
L.
------- End of Forwarded Message
∂03-Mar-87 0900 JMC
camera
∂03-Mar-87 1003 coraki!pratt@sun.com Mitchell schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 10:03:50 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Tue, 3 Mar 87 10:01:22 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA07863; Tue, 3 Mar 87 09:57:47 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA28261; Tue, 3 Mar 87 10:02:43 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA02533; Tue, 3 Mar 87 10:03:16 PST
Date: Tue, 3 Mar 87 10:03:16 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8703031803.AA02533@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell schedule
Mitchell's schedule to date is as follows. Let me know if you
would like an appointment with him. I'm thinking of eating at
Mama's for lunch, let me know if you want to join us. Dinner
is also open, location to be determined.
10:00-11:00 talk
11:00-11:30 Guibas
11:30-12:00 Ullman
12:00- 1:15 lunch
1:15- 1:45 Mayr
1:45- 3:15 CS459
3:15- 3:45 Knuth
3:45- 4:45 students
4:00- 4:30
4:30- 5:00
5:00- 5:30
6:00 dinner
∂03-Mar-87 1037 RICHARDSON@Score.Stanford.EDU Binford
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 10:37:19 PST
Date: Tue 3 Mar 87 10:29:56-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Binford
To: jmc@Sail.Stanford.EDU
cc: ra@Sail.Stanford.EDU
Message-ID: <12283483466.11.RICHARDSON@Score.Stanford.EDU>
John,
Would you be available on March 10 at 3:30 to discuss the Binford case
at a faculty meeting?
-Anne
-------
∂03-Mar-87 1124 MAYR@score.stanford.edu joel friedman's schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 11:24:53 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 3 Mar 87 11:22:35 PST
Date: Tue 3 Mar 87 11:18:58-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: joel friedman's schedule
To: fndsch@navajo.stanford.edu, golub@score.stanford.edu,
oliger@navajo.stanford.edu, haddad@sushi.stanford.edu,
nilsson@score.stanford.edu
Message-Id: <12283492391.45.MAYR@Score.Stanford.EDU>
Here is Joel Friedman's schedule for tomorrow:
Who: Joel Friedman, UC Berkeley
What: "On the Convergence of Newton's Method"
When: Wednesday, March 4, at 2:15pm
Where: MJH352
Why: It's a wonderful talk, and he is applying here for a faculty position.
Schedule:
9:00- 9:30 Mayr MJH334
9:30-10:00 Golub
10:00-11:00 Guibas
11:00-11:30 Ullman
11:30-12:00 Knuth
12:00- 1:30 lunch at FC; Knuth, Papa
1:30- 2:00 Nilsson
2:00- 3:30 talk
3:30- 4:00 Pratt
4:00- 4:30 Oliger
4:30- 5:30 students
6:00- dinner
-------
∂03-Mar-87 1151 RIVIN@Score.Stanford.EDU Re: algebraic computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 11:51:08 PST
Date: Tue 3 Mar 87 11:49:01-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: Re: algebraic computation
To: NILSSON@Score.Stanford.EDU
cc: RIVIN@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
In-Reply-To: <12281677581.43.NILSSON@Score.Stanford.EDU>
Message-ID: <12283497861.51.RIVIN@Score.Stanford.EDU>
Here is the paragraph you wanted. I suspect it would be best to have this
cross-listed in the Mathematics Dept. I am not sure what the formal
prerequisites should be (not being familiar with the curriculum).
Topics in Computer Algebra.
In this course we will cover some of the techniques of Computer algebra:
Simplification, polynomial and integer arithmetic (including
factorization and solution of systems) closed-form integration
and the calculus of special functions
are some of the topics that may be covered.
Prerequisites(?): Helpful would be familiarity with modern algebra, number
theory and Complex analysis, as well as facility with a programming
language (preferably LISP). An attempt will be made to keep the course
self-contained.
Igor.
-------
∂03-Mar-87 1214 RIVIN@Score.Stanford.EDU Re: algebraic computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 12:14:28 PST
Date: Tue 3 Mar 87 12:12:15-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: Re: algebraic computation
To: NILSSON@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
cc: RIVIN@Score.Stanford.EDU
In-Reply-To: <12283497861.51.RIVIN@Score.Stanford.EDU>
Message-ID: <12283502092.51.RIVIN@Score.Stanford.EDU>
Mail-From: RIVIN created at 3-Mar-87 11:49:01
Date: Tue 3 Mar 87 11:49:01-PST
From: Igor Rivin <RIVIN@Score.Stanford.EDU>
Subject: Re: algebraic computation
To: NILSSON@Score.Stanford.EDU
cc: RIVIN@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
In-Reply-To: <12281677581.43.NILSSON@Score.Stanford.EDU>
Message-ID: <12283497861.51.RIVIN@Score.Stanford.EDU>
Amended by data-compressing the previous description...
Topics in Computer Algebra.
Techniques of computer algebra; topics may include
simplification, polynomial and integer arithmetic (including
factorization and solution of systems) closed-form integration
and the calculus of special functions.
Prerequisites(?): Familiarity with modern algebra, number
theory and complex analysis, as well as facility with a programming
language (preferably LISP) are helpful. An attempt will be made to keep
the course self-contained.
Formal Prerec: Instructor's consent.
Igor.
-------
-------
∂03-Mar-87 1322 RICHARDSON@Score.Stanford.EDU Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 13:21:53 PST
Date: Tue 3 Mar 87 13:20:28-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Faculty Meeting
To: buchanan@SUMEX-AIM.Stanford.EDU, feigenbaum@SUMEX-AIM.Stanford.EDU,
rwf@Sail.Stanford.EDU, golub@Score.Stanford.EDU, jlh@Sonoma.Stanford.EDU,
dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU,
ejm@Sierra.Stanford.EDU, papa@Score.Stanford.EDU,
pratt@Navajo.Stanford.EDU, ullman@Score.Stanford.EDU
cc: bscott@Score.Stanford.EDU
Message-ID: <12283514509.23.RICHARDSON@Score.Stanford.EDU>
There will be a faculty meeting of full professors to discuss the possible
reappointment of Tom Binford on Tuesday, March 10 at 3:30 in MJH 252. (Note:
time is 3:30 rather than the usual 2:30.)
-------
∂03-Mar-87 1331 guibas@navajo.stanford.edu whole faculty meeting for foundations appointments
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 13:31:31 PST
Received: by navajo.stanford.edu; Tue, 3 Mar 87 13:29:28 PST
Date: 3 Mar 1987 1329-PST (Tuesday)
From: Leonidas Guibas <guibas@navajo.stanford.edu>
To: fndsch@navajo.stanford.edu
Cc: guibas@navajo.stanford.edu, richardson@score.stanford.edu
Subject: whole faculty meeting for foundations appointments
please reserve the usual faculty meeting slot (2:30-4:00) on tuesday,
april 7, for a presentation to the whole faculty of our committee's
recommendations. papers have to be in the school of engineering by april
15 for appointments beginning fall.
l.
∂03-Mar-87 1332 RICHARDSON@Score.Stanford.EDU Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Mar 87 13:32:46 PST
Date: Tue 3 Mar 87 13:31:17-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Faculty Meeting
To: buchanan@SUMEX-AIM.Stanford.EDU, feigenbaum@SUMEX-AIM.Stanford.EDU,
rwf@Sail.Stanford.EDU, golub@Score.Stanford.EDU, jlh@Sonoma.Stanford.EDU,
dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU,
ejm@Sierra.Stanford.EDU, papa@Score.Stanford.EDU,
pratt@Navajo.Stanford.EDU, ullman@Score.Stanford.EDU
Message-ID: <12283516480.23.RICHARDSON@Score.Stanford.EDU>
Prior to the faculty meeting scheduled for Tuesday, March 10 please come
by my office to look through the file and read the letters.
-------
∂03-Mar-87 1531 RA Virginia Mann
Mann called and wanted to know in which quarter you intend to teach VTSS 160
next year. She also wanted to know whether the current catalog
course description needs
and changes. If you let me know, I will let her know. If you want to call
her directly, her tel. is 3-2565.
∂03-Mar-87 1707 RA article about AI
Diana Jacobs is writing an article for SOLUTION magazine about the development
of AI. She would like to have a short telephone interview with you. What she
would like to ask you is:
1. Why did you convene the by now famous 1956 seminar? What did you feel
the mood of the participants and their expectations were at the time.
2. Are you surprised at how far AI has gotten, or disappointed with what
has been achieved so far.
3. What do you feel is the 'hot spot' in AI right now.
4. What do you think will be the next break through? Vision, voice?
Her tel. (313) 478 8244. She called a few time and will try again later.
∂04-Mar-87 0858 JMC
susie
∂04-Mar-87 0910 SIEGMAN@Sierra.Stanford.EDU Faculty AIDS Cases
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Mar 87 09:10:33 PST
Date: Wed 4 Mar 87 08:04:33-PST
From: Tony Siegman <SIEGMAN@Sierra.Stanford.EDU>
Subject: Faculty AIDS Cases
To: jmc@Sail.Stanford.EDU
Message-ID: <12283719143.14.SIEGMAN@Sierra.Stanford.EDU>
One additional faculty death from AIDS (I'm pretty sure) was my
next-door-plus-one neighbor Dr. Brett from the Med School. It was
interesting to note that his house -- the one-time Hargadon residence --
was extensively fumigated (big plastic wrapping over the whole house) after
his death. Whether this was a real termite problem, or just a "make the
next buyer feel safe" measure I don't know. I have to say, if I were buying
a house in which it was known that someone had died (in the house) of AIDS,
I'd probably fumigate also, even though intellectually I recognize it's
pointless.
-------
∂04-Mar-87 1115 GCOLE@Sushi.Stanford.EDU re: Removing Reagan
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Mar 87 11:15:01 PST
Date: Wed 4 Mar 87 11:13:30-PST
From: George Cole <GCOLE@Sushi.Stanford.EDU>
Subject: re: Removing Reagan
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 3 Mar 87 21:35:00-PST
Message-ID: <12283753541.23.GCOLE@Sushi.Stanford.EDU>
Botheration; I had mistyped "inable" for "unable" (simply explained; I was
concentrating on the original wording of the Constitution at the time, trying
to read my own handwriting). But the phrase refers to "inability", not
"disability". I assume the y.yduJ@SPAR sent a message to you concerning this.
George
-------
∂04-Mar-87 1231 RA pictures
Mary from VTSS takes pictures of VTSS faculty. She was wondering when
she can come by to take your picture. Her tel. 5-0119.
∂04-Mar-87 1254 LES Proposed loan agreement with Computer Museum
To: JMC@SAIL.STANFORD.EDU, BXR@SAIL.STANFORD.EDU,
Binford@WHITNEY.STANFORD.EDU, Nilsson@SCORE.STANFORD.EDU
Here are proposed "final" terms for the loan of robotics equipment and
sale of videotapes to The Computer Museum of Boston. Remarks invited.
Les
Stanford University
Department of Computer Science
Stanford, CA 94305
(415) 723-9729
1986 October 10
Oliver Strimpel
The Computer Museum
300 Congress Street
Boston, MA 02210
Dear Mr. Strimpel:
This is a slightly slow response to your letter of July 31,
1985, requesting the loan of some of our earlier experimental equipment
for use in your exhibits, as follows. Valuations are shown for these
devices for insurance purposes.
Rancho Arm: $10k
Stanford Arm: $20k
Hydraulic Arm: $30k
Orm: $8k
Cart: $5k (without camera, unless we can find it)
Piano Mover: $30k
We agree to make any or all of these devices available under the
following terms.
1. Packing and shipping costs to get these items to The Computer
Museum will be borne by the Museum.
2. Whichever devices are acquired under this loan will be
insured against loss or damage during shipping and for the duration of
the loan for the amounts given below. The cost of this insurance will
be borne by the Museum and the beneficiary will be Stanford.
2. This is to be a renewable five-year loan subject to the
following conditions:
(a) the Museum may terminate it at any time by offering to return
these items with the shipping costs prepaid;
(b) Stanford may terminate it with three months advance notice, in
which case Stanford will bear the return shipping costs;
(c) at the end of five years, Stanford may either offer to extend
this loan under the same or different terms or may request that
some or all of the devices be returned to Stanford at the
expense of the Museum.
As we discussed, I plan to have a number of our documentary
films transferred to video tape and will have copies made available to
you at copying cost in VHS format. My understanding is that you are
interested in the following films:
Butterfinger
Hear Here
Instant Insanity
Motion and Vision
Computer Interactive Picture Processing
Display Simulations of 6-legged Walking
Please cross out any films you do not want.
If you agree to these terms, please sign and return a copy of
this letter.
Sincerely,
Les Earnest
Associate Chair., Department of Computer Science
Agreed.
Date:
Title: Location:
for The Computer Museum
∂04-Mar-87 1312 guibas@decwrl.dec.com final Subhash Suri schedule
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Mar 87 13:11:57 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Wed, 4 Mar 87 13:10:40 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA10728; Wed, 4 Mar 87 13:12:12 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA12815; Wed, 4 Mar 87 13:12:03 PST
Date: Wed, 4 Mar 87 13:12:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8703042112.AA12815@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: richardson@score.stanford.edu
Subject: final Subhash Suri schedule
if you would like to join us for dinner, please let me know
Subhash Suri schedule
Thursday, March 5
10:00-10:30 Jeff Ullman MJH 338
10:30-11:00 Nils Nilsson MJH 216
11:00-12:00 Leo Guibas MJH 330
12:00-12:30 fast food lunch
12:30- 1:30 AFLB talk MJH 352
1:30- 2:00 Christos P. MJH 332
2:00- 2:30 Don Knuth MJH 328
2:30- 3:00
3:00- 4:00 Students MJH 352
4:00- 4:30 Ernst Mayr MJH 334
4:30- 5:00 Vaughan Pratt MJH 428
∂04-Mar-87 1556 CLT This week's Qlisp meeting
To: "@Q.DIS[1,CLT]"@SAIL.STANFORD.EDU
Time: Friday Mar 6, 11:00
Place: 252 Margaret Jacks
Topic: Recent developments in specification of Qlisp
∂04-Mar-87 1605 LES Formal Reasoning Budget
Here is a copy of both your main part and the current MTC budget. -Les
March 3, 1987 1
Proposal to DARPA
for
Research in Formal Reasoning
Budget for Three Years beginning 1 June 1987
Personnel Annual Cost
Prof. John McCarthy (17% acad. yr., 35% Sum.) 20,010
Yoav Shoham, Asst. Professor (25% acad. yr., 33% Sum.) 14,399
Vladimir Lifschitz, Sr. Research Assoc. (100%) 60,504
Lester Earnest, Sr. Research Assoc. (15%) 11,695
Robert Givan, Student Res. Ast. (50% acad. yr., 100% Sum.) 14,325
--------, Student Res. Assist. (50% acad. yr., 100% Sum.) 14,325
--------, Student Res. Assist. (50% acad. yr., 100% Sum.) 14,325
Rutie Adler, Secretary (35%) 8,371
---------
Annual salary subtotal 157,954
Annual budget begin dates 6/1/87- 6/1/88- 6/1/89-
End dates 5/31/88 5/31/89 5/31/90
Annual salary subtotal 157,954 157,954 157,954
Allowance for salary increases 7,108 16,585 26,062
(6% beginning 9/1/87,
12% beginning 9/1/88,
18% beginning 9/1/89)
--------- --------- ---------
Salary total by year 165,062 174,539 184,016
Staff benefits (24.7% till 9/1/87, 42,380 46,296 49,960
26.0% till 9/1/88, 26.7% till 9/1/89,
27.3% thereafter)
Travel (3 East Coast trips/year 5,500 5,500 5,500
@ $1000, 5 Western trips/yr.
@ $500)
Computer time costs 60,000 60,000 60,000
Other direct costs (publications, 18,000 18,000 18,000
supplies, telephones and
other services)
--------- --------- ---------
Subtotal 290,942 304,335 317,476
Indirect Costs (73%) 212,388 222,165 231,757
--------- --------- ---------
Total by year 503,330 526,500 549,233
--------- --------- ---------
Cumulative totals 503,330 1,029,830 1,579,063
March 4, 1987 2
Proposal to DARPA
for
Research in Mathematical Theory of Computation
Budget for Three Years beginning 1 June 1987
Personnel Annual Cost
Prof. John McCarthy (8% acad. yr., 15% Sum.) 9,075
Carolyn Talcott, Research Assoc. (50%) 25,998
N. Shankar, Research Assoc. (100%) 45,996
Gian-Luigi Bellin, Stud. Res. Ast. (50% acad. yr., 100% Sum.) 14,325
--------, Student Res. Assist. (50% acad. yr., 100% Sum.) 14,325
Rutie Adler, Secretary (15%) 3,587
---------
Annual salary subtotal 113,306
Annual budget begin dates 6/1/87- 6/1/88- 6/1/89-
End dates 5/31/88 5/31/89 5/31/90
Annual salary subtotal 113,306 113,306 113,306
Allowance for salary increases 5,099 11,897 18,695
(6% beginning 9/1/87,
12% beginning 9/1/88,
18% beginning 9/1/89)
--------- --------- ---------
Salary total by year 118,405 125,203 132,001
Staff benefits (24.7% till 9/1/87, 30,400 33,210 35,838
26.0% till 9/1/88, 26.7% till 9/1/89,
27.3% thereafter)
Travel (1 East Coast trip/year 2,500 2,500 2,500
@ $1000, 3 Western trips/yr.
@ $500)
Computer time costs 20,000 20,500 21,000
Other direct costs (publications, 8,000 8,000 8,000
supplies, telephones and
other services)
--------- --------- ---------
Subtotal 179,305 189,413 199,339
Indirect Costs (73%) 130,893 138,271 145,517
--------- --------- ---------
Total by year 310,198 327,684 344,856
--------- --------- ---------
Cumulative totals 310,198 637,882 982,738
∂04-Mar-87 1644 rosenberg%hplsr@hplabs.HP.COM Procedure for volunteering to organize a workshop
Received: from HPLABS.HP.COM by SAIL.STANFORD.EDU with TCP; 4 Mar 87 16:44:02 PST
Received: from hplms1 by hplabs.HP.COM ; Wed, 25 Feb 87 18:56:17 pst
Received: from hplsr (hplsr) by hplms1; Wed, 25 Feb 87 17:47:02 pst
Return-Path: <rosenberg@hplsr>
Received: by hplsr ; Wed, 25 Feb 87 17:46:25 pst
From: Steven Rosenberg <rosenberg%hplsr@hplabs.HP.COM>
Message-Id: <8702260146.AA10148@hplsr>
Date: Wed, 25 Feb 87 17:46:21 PDT
Subject: Procedure for volunteering to organize a workshop
To: jmc@su-ai.ARPA
Cc: rosenberg%hplsr@hplabs.HP.COM
X-Mailer: NMail [$Revision: 2.7 $]
John,
I am thinking of volunteering to organize an AAAI workshop on frame
representation languages. It has been more than a decade since Minsky's
original paper, and since then we have had several generations of such
languages (FRL, KRL, KL-ONE, KRYPTON, etc.) culminating in modern
commercial languages, such as KEE, as well as proprietary (HP-RL) and newer
academic (KODIAK) varients. They are the predominent paradigm for
constructing expert systems, and are used in conjunction with other tools
in many areas of AI research. Terms like "Frames", "Units", "Schemas",
etc. abound, with no consistent usage or definitions. It might be a good
time to take stock of where we have gotten to, and where we ought to be
going.
Some of the interesting questions to address might be:
Are Frames and Objects two ends of a single continuum? If so, how do we
reconcile the conflict between the Frame programming approach of
emphasizing data representation with the object oriented programming
approach of data encapsulation?
What are the open theoretical issues in this approach to knowledge
representation?
What progress have we made in the last decade?
How can we construct generic knowledge bases?
Ought we to think about creating standards?
What is the process for volunteering and submitting a proposal to you?
Regards,
Steven Rosenberg
-------
∂04-Mar-87 1648 WIEDERHOLD@Score.Stanford.EDU Sowa
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Mar 87 16:48:32 PST
Date: Wed 4 Mar 87 16:46:09-PST
From: Gio Wiederhold <WIEDERHOLD@Score.Stanford.EDU>
Subject: Sowa
To: jmc@Sail.Stanford.EDU
cc: wiederhold@Score.Stanford.EDU
Message-ID: <12283814098.34.WIEDERHOLD@Score.Stanford.EDU>
I received a copy of John Sowa's inquiry re expenses.
If we can put the stipend in an unrestricted fund in his name,
then he can draw on it and it would not be taxable income.
Gio
-------
∂04-Mar-87 2117 binford@whitney.stanford.edu Proposed loan agreement with Computer Museum
Received: from WHITNEY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Mar 87 21:17:17 PST
Received: by whitney.stanford.edu; Wed, 4 Mar 87 21:18:15 PST
Date: Wed, 4 Mar 87 21:18:15 PST
From: Tom Binford <binford@whitney.stanford.edu>
To: LES@sail.stanford.edu
Cc: JMC@sail.stanford.edu, BXR@sail.stanford.edu, Nilsson@score.stanford.edu
In-Reply-To: Les Earnest's message of 04 Mar 87 1254 PST
Subject: Proposed loan agreement with Computer Museum
The letter looks ok to me.
∂05-Mar-87 0702 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab Your visit
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 07:02:08 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Thu 5 Mar 87 06:59:45-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Thu 5 Mar 87 18:54:03
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Thu, 5 Mar 87 18:53:58 jst
Date: Thu, 5 Mar 87 18:53:58 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8703050953.AA13317@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20
Subject: Your visit
I talked to Professor Goto, and he said he was looking forward to your
visit. Please contact him when you arrived in Kyoto. His telephone
numbers are: 03-812-2111 ext. 4113 (Tokyo Univ.) and 03-828-3794 (a
research institute for Josephson computer).
Professor Ito is wishing to organize a lecture by you for faculty
members and students of Tohoku University. The lecture will be hosted
by the Faculty of Engineering, and we would like to have it on April
10 if possible.
Iwanami Shoten (one of the best publisher in Japan) is asking if it
would be possible to tape-record your lecture and publish the
translation in one of their scientific magazines.
Moreover, it would be nice if you could give a talk whose title would be
something like: "Lisp and AI". Your contributions to Lisp and AI are so
great that it will be a great opportunity for the audience of your lecture
(and also for the readers of the recorded lecture). An informal and
non-technical talk will be welcome. I would like to hear about
history of Lisp, your opinion on Common Lisp, Lisp machine, concurrent
or parallel Lisp etc. (Well, there are so many things to talk on Lisp
alone.)
Please let me know:
(1) if you would accept to give a talk and
(2) if you would permit to publish your talk.
If your answer is positive, please also let me know the title of your
talk. If you must work hard to prepare the talk, then please don't
hesitate to say no.
** masahiko **
∂05-Mar-87 0900 JMC
Menlo clinic
∂05-Mar-87 1145 RA Ron Gatterdam
Ron Gatterdam from the University of Alaska called re your plans for
visiting Alaska. His tel. (907) 474 6174.
∂05-Mar-87 1357 RA Richard Schroeppel
Schroeppel called re resolving date for next SAB meeting.
∂05-Mar-87 1552 GINN@Sushi.Stanford.EDU CS326
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 15:52:43 PST
Date: Thu 5 Mar 87 15:51:21-PST
From: Michael Ginn <GINN@Sushi.Stanford.EDU>
Subject: CS326
To: jmc@Sail.Stanford.EDU
Message-ID: <12284066264.43.GINN@Sushi.Stanford.EDU>
I need to make plan reservations for spring break, which starts
March 21. Do you need me to stay during part of spring break?
---Michael Ginn, TA
-------
∂05-Mar-87 1604 RA leaving
It's Thursday and I am leaving early.
∂05-Mar-87 1736 RDZ@Sushi.Stanford.EDU 3600 Demonstration
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 17:36:39 PST
Date: Thu, 5 Mar 1987 17:35 PST
Message-ID: <RDZ.12284085170.BABYL@SUSHI.STANFORD.EDU>
From: Ramin Zabih <RDZ@Sushi.Stanford.EDU>
To: jmc@Sail.Stanford.EDU
Cc: RDZ@Sushi.Stanford.EDU
Subject: 3600 Demonstration
I can pretty much schedule this whenever is convenient. The talk I
gave Wednesday focused on the Compile-Edit-Debug loop, which is the
best part of the Lisp Machine environment. It took me about an hour.
Ramin
∂05-Mar-87 1903 KOHEN@Sushi.Stanford.EDU Inference Corp.
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 19:03:31 PST
Date: Thu 5 Mar 87 19:02:12-PST
From: Abraham Kohen <KOHEN@Sushi.Stanford.EDU>
Subject: Inference Corp.
To: jmc@Sail.Stanford.EDU
Message-ID: <12284101010.14.KOHEN@Sushi.Stanford.EDU>
Les Ernest tells me that you're on Inference's board.
Is there an Avraham Gutman (sp?) at Inference?
Would you have an e-mail address or phone number for Mr. Gutman or
for Inference ?
Thank you,
Abe Kohen
-------
∂05-Mar-87 2017 GINN@Sushi.Stanford.EDU re: CS326
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 20:17:50 PST
Date: Thu 5 Mar 87 20:16:32-PST
From: Michael Ginn <GINN@Sushi.Stanford.EDU>
Subject: re: CS326
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 5 Mar 87 15:56:00-PST
Message-ID: <12284114539.27.GINN@Sushi.Stanford.EDU>
March 20th is the scheduled day of the final. I'll plan on leaving
the 23rd unless I hear otherwise from you.
---Michael
-------
∂05-Mar-87 2158 CRISPIN@SUMEX-AIM.STANFORD.EDU re: "ROC flag"-continue
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 21:58:46 PST
Date: Thu 5 Mar 87 21:58:29-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: re: "ROC flag"-continue
To: JMC@SAIL.STANFORD.EDU
cc: PAO@SIERRA.STANFORD.EDU, su-etc@SUMEX-AIM.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 5 Mar 87 21:20:00-PST
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12284133101.16.CRISPIN@SUMEX-AIM.STANFORD.EDU>
I never said that "starving peasants have no need for Western
democracy." What I said was that "starving peasants [or, for that
matter, people in general] care less about democracy than they care
about not starving." Throughout history, mankind has repeatedly
expressed a strong desire to give up freedom to a dictator that
will feed it. It was reported that in Nazi Germany it was often
joked that "the US press was right; Hitler has taken away our
freedom. He took away our freedom to starve!"
It is an academic question which is the better government: a
democracy that lets its people starve or a dictatorship that
guarantees that everybody is fed. We, as well-fed intellectuals,
may express our fondness for the former. But mankind has reliably
chosen the latter. That is a practical reality that is unaffected
by ivory-tower polemics.
The Chetniks were discredited in the eyes of the Western allies
by 1944. Churchill notes that "the Chiefs of Staff reported on
June 6 [1943]: `it is clear from information available to the War
Office that the Chetniks are hopelessly compreomised in their
relations with the Axis in Herzegovinia and Montenegro.'" There
was open collaboration between the Chetniks and the Italians against
the Partisans. Because of this, even though the Partisans were
dominated by Communists they received the bulk of Allied support
towards the end of the war.
Additionally, at Mihailovic's trial in June/July of 1946, he
admitted to having fought against the National Liberation Army
(Partisan), but defended his actions as fighting against the
Communists. However, under cross-examination he confessed to having
fought against non-Communist Partisan units as well. This torpedoed
his defense; after that his goose was cooked. He was found guilty
of being a traitor and shot for that reason, NOT for having been an
anti-Communist.
One wonders what would have happened had Mihailovic been a bit
more selective about who he fought and who he collaborated with.
-- Mark --
-------
∂05-Mar-87 2217 @SUMEX-AIM.STANFORD.EDU:Crispin@SUMEX-AIM.Stanford.EDU ROC, etc...
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 5 Mar 87 22:16:51 PST
Received: from KSL-1186-4.Stanford.EDU by SUMEX-AIM.STANFORD.EDU with TCP; Thu 5 Mar 87 22:16:23-PST
Date: Thu, 5 Mar 87 22:11:12 PST
From: Mark Crispin <Crispin@SUMEX-AIM.Stanford.EDU>
Subject: ROC, etc...
To: John McCarthy <JMC@SAIL.Stanford.Edu>
cc: Ravers who flame at Stanford <SU-etc@SUMEX-AIM.Stanford.Edu>
Message-ID: <571978624.A0051.KSL-1186-4.Crispin@SUMEX-AIM.Stanford.EDU>
Nobody has answered my contention that the correct way to deal with a
Communist insurgency is to ignore it and instead try to address the real
concerns of the populace. A government that is truly free (meaning that a
Communist party can operate openly and legally) and responsive to the needs
of its people has little to fear from a Communist party. I can not think of
a single truly free nation that has become Communist. All of today's
Communist states were either under foreign occupation or were under an
autocratic government (some of which were "democratic" in name but not in
reality).
The only possible exceptions I can think of are Cuba and Czechoslovakia.
In Cuba, the first year or so under Castro had at least a veneer of democracy;
but if you take as a given that Castro always intended to establish a Communist
state then Cuba follows the pattern since Batista fits the nasty dictator mold
quite nicely. Czechoslovakia is harder to dismiss, but one could argue that
the free government of Czechoslovakia died in 1938 with the Nazi takeover. By
that reasoning, the post-war government was a fantasy that Stalin tolerated
for a few years. Certainly the post-war government's goose was cooked from
the very beginning.
∂05-Mar-87 2232 ARIMA%icot.jp@RELAY.CS.NET On your visit to ICOT (Tokyo)
Received: from RELAY.CS.NET by SAIL.STANFORD.EDU with TCP; 5 Mar 87 22:31:49 PST
Received: from relay2.cs.net by RELAY.CS.NET id ai14113; 6 Mar 87 1:20 EST
Received: from icot.jp by RELAY.CS.NET id aa06231; 6 Mar 87 1:14 EST
Received: from ICOT20.ICOT.JP by icot.jp (1.1/6.2[Junet/CSnet])
id AA21384; Fri, 6 Mar 87 13:31:43 JST
Date: Fri 6 Mar 87 13:32:02
From: ARIMA%ICOT20.ICOT%icot.jp@RELAY.CS.NET
Subject: On your visit to ICOT (Tokyo)
To: jmc@SAIL.STANFORD.EDU
Message-Id: <12284117363.26.ARIMA@ICOT20.ICOT.JP>
Dear Prof. McCarthy
Prof. Masahiko Sato informed us of your visit to ICOT. It is our great
pleasure to meet you. We are always encouraged in our studies by your
remarkable contributions to AI fields.
Now, we would like to arrange your plan at ICOT. The following is our
proposal for your visit to ICOT. Please let us know your opinions with
respect to this.
Visiting plan to ICOT
1.(date) April 7 [Tue]
2.(approximately 2 hours in the morning) Informal
discussions about "Non-monotonic Reasoning" with a few
persons, including Prof. Nakagawa and me (Arima), who are
strongly interested in it and studying it actually.
3.(approximately 2 hours in the afternoon) We would like
to have your lecture on your current research topics. The
attendance will be ICOT members and some othe researchers
who have interest in the topics.
Please inform us what title your lecture is and what you
use in the lecture (OHP, slide projector, etc).
We are looking forward to seeing you in Tokyo and discussing some problems
of AI with you.
Sincerely yours,
Jun Arima
Researcher
cc: Dr. Furukawa ( Deputy Director, Research Center )
cc: Dr. Ito ( Chief, First Research Laboratory )
-------
∂06-Mar-87 0900 JMC
qlisp
∂06-Mar-87 1045 RA macros
I have misplaced the paper on which I wrote what you want the macros in elephant
to do, could you please tell me again.
Thanks,
∂06-Mar-87 1048 R.ROLAND@LEAR.STANFORD.EDU aids
Received: from LEAR.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Mar 87 10:48:08 PST
Date: Fri 6 Mar 87 10:48:22-PST
From: Roland van Gaalen <R.ROLAND@LEAR.STANFORD.EDU>
Subject: aids
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12284273254.20.R.ROLAND@LEAR.STANFORD.EDU>
I just talked to Ed Hilton, MD, AIDS Coordinator for San Mateo
County. He gave me the following information:
--people with AIDS do not lose their ability to fight infections
such as the common cold and influenza
--they may no longer be able to fight some very specific
infections involving very common viruses
[more specifically, their T-cell response
is jeopardized, not their B-cell reponse]
--THEREFORE, JMC's argument for isolating people with AIDS
does not hold water (I discussed this with him specifically)
--concerning contact tracing: his office DOES NOT and WILL
not do it; reason: the long incubation period (usually at least
several years); he reiterated the Public Health Service's position
that contact tracing is done primarily to offer a treatment,
which is not available in the case of AIDS
If there are additional questions, I will try to find
authoritive information to answer them.
--Roland
-------
∂06-Mar-87 1111 RA Richard Schroeppel
The SAB meeting is April 20, 9:30. I put it in your calendar.
∂06-Mar-87 1156 PAPA@score.stanford.edu Meeting today
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Mar 87 11:56:17 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Fri, 6 Mar 87 11:55:08 PST
Date: Fri 6 Mar 87 11:52:02-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Meeting today
To: guibas@score.stanford.edu
Cc: fndsch@navajo.stanford.edu
Message-Id: <12284284842.51.PAPA@Score.Stanford.EDU>
I am sick at hoem , and I MAY miss our meeting. Also, my terminal is
disintegrating, and I doin't quite see what I'm writing. Here is my
opinion on the candidates I saw so far:
COLE: His research record is very good. I missed his talk, and I do not think
I ever heard him talk. In my discussion he came across as frightened by
everyday details of academic life, like grants etc. He has effectively tenure.
SLEATOR: I like him a lot, and I enjoyed his talk. In terms of research, I am
not 100% sure that he survives all comarisons he has to. He has a pleasant
personality, and a kind of Stanford loyalty that could make a difference.
SURI: He impressed me as very smart and quick in our discussion. He has no
plans outside Computational Geometry, but I guess this is alright, given the
breadth of the field. His talk seemed flat, in that he appeared to enjoy
detail.
FRIEDMAN: Among all our candidates, he seems to me that he is the only
credible ``Yao replacement'. He is VERY smart, and will be heard from without
doubt. Unfortunately, he has remarkably little commitment to CS for a
candidate in this search.
In all, I can still see negative sides to all candidates, and I would like to
see the other ones befoire choosing.
---Christos.
-------
∂06-Mar-87 1510 SJG Taming the Shrew on Sunday
To: JMC@SAIL.STANFORD.EDU, scholz@SUSHI.STANFORD.EDU,
khoward@SCORE.STANFORD.EDU
7.30 at my place -- 3233 Bryant. Take Alma south from page mill;
the third left is Loma Verde (you'll probably go by it, since it's
hard to find in the dark). Then go to the stop sign (Bryant), and
turn right. My house is a block and a half on the left; it's the
only two-story house on that side of Bryant on that block, and my
green Honda should be in front.
See you then!
Matt
∂06-Mar-87 1652 VAL cs326 final
I'd like to help you with writing the final. I'm going to MCC next Wednesday,
so let's decide some time soon what I should do.
∂07-Mar-87 1259 JJW DIAL job
I logged out your DIAL job when the system came back up.
∂07-Mar-87 1325 R.ROLAND@LEAR.STANFORD.EDU aids
Received: from LEAR.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Mar 87 13:25:20 PST
Date: Sat 7 Mar 87 13:25:29-PST
From: Roland van Gaalen <R.ROLAND@LEAR.STANFORD.EDU>
Subject: aids
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12284563999.23.R.ROLAND@LEAR.STANFORD.EDU>
(re JMC's question if people with AIDS could pass on all sorts of
other diseases to others)
Yesterday I talked to several somewhat influential people involved in
AIDS coordination in San Jose and San Mateo.
They confirmed that people with AIDS tend to be susceptible to
so-called opportunistic infections, to which everybody is exposed in
ordinary daily life. People whose immune system is healthy have no
problem fighting these infections, but people whose immune system is
impaired may not.
Therefore, there is no reason concern.
--Roland
-------
∂07-Mar-87 1350 JSW Futures
To: Qlisp@SAIL.STANFORD.EDU
Here is a summary of the discussions we have been having about futures
in the past week, along with some additional comments.
The EAGER forms of QLET and QLAMBDA cause situations where a process may
try to reference a value that does not yet exist, because some other
process is computing it. Such values are represented by "empty binding
cells" in the language of the Qlisp paper, or "futures" in Multilisp
terminology. An attempt to reference the value of a future must cause a
process to wait until the value is computed. Such references always occur
inside Common Lisp primitive functions. The implementation of these
primitives must be modified in some way in order to make this work. The
greatest complication is when such a primitive is converted to inline code
by the compiler, since then we might need to change the compiler.
Several alternatives have been proposed.
1. Before compiling (perhaps also before interpreting) Qlisp code, decide
which arguments to primitive functions might be futures when the call
is executed, and wrap them in a POTENTIAL-FUTURE form if the function
will need to reference the value. POTENTIAL-FUTURE will do a runtime
test of the type of an object, cause the process to wait if it is a
future, and return the object's value. This code transformation can
probably be done automatically.
The main drawbacks that I see are (a) practically every argument to a
primitive function will need a POTENTIAL-FUTURE form (see below), and
(b) when a primitive function examines more than one level into an
object, the POTENTIAL-FUTURE test is not sufficient. For example, the
LENGTH function applied to a list will not work unless the list and all
of its sublists are not futures. In such a case, one would have to
convert (LENGTH X) into (LENGTH (NO-SUBLIST-FUTURES X)), where
NO-SUBLIST-FUTURES goes through all of the sublists of X, waiting
whenever it sees a future.
2. Instead of using all of the built-in primitives, write some of them
explicitly. This would avoid unnecessary waiting for some futures that
are substructures of an argument to a primitive. For example, to call
(ASSOC X Y), we will have to ensure that X, Y, all of the sublists of
Y, and the CAR and CAAR of each sublist of Y are not futures. But if X
is found near the beginning of Y, this may cause unnecessary waiting.
By writing ASSOC in terms of CAR, CDR and EQL, we avoid this problem.
I've spent some time looking through the Common Lisp manual to classify
all of the primitive functions (and some special forms and macros) based
on whether they reference the values of some or all of their arguments,
and whether they examine substructure of some arguments, in which case
the POTENTIAL-FUTURE form isn't sufficient.
Here are the functions that don't reference any of their arguments. They
just create new data structures or copy pointers without caring what
objects they point to.
acons list* setf
cons psetf setq
[defstruct psetq shiftf
constructors] push values
list rotatef vector
A few functions need to wait for some arguments but not others. These
include rplaca, set, vector-push, etc.
The overwhelming majority of Common Lisp primitive functions need the
values of all of their arguments. This suggests that most calls to
primitives will need POTENTIAL-FUTURE forms around the arguments if we
want to avoid rewriting the primitive functions.
The primitives for which this is not sufficient include all of the
sequence functions and any others that operate on lists or S-expressions,
because these objects could contain futures as subexpressions even when
the object itself isn't a future. Here are the ones I've found; there
are probably some missing.
adjoin find princ
append find-if princ-to-string
assoc find-if-not print
assoc-if fourth progv
assoc-if-not get-properties pushnew
assq import rassoc
butlast intersection rassoc-if
caaaar last rassoc-if-not
caaadr ldiff reduce
caaar length remove
caadar list-length remove-duplicates
caaddr list-nreverse remove-if
caadr list-reverse remove-if-not
caar map replace
cadaar mapc revappend
cadadr mapcan reverse
cadar mapcar search
caddar mapcon second
cadddr mapl set-difference
caddr maplist set-exclusive-or
cadr member seventh
cdaaar member-if shadow
cdaadr member-if-not shadowing-import
cdaar memq sixth
cdadar merge some
cdaddr mismatch sort
cdadr nbutlast stable-sort
cdar nconc string-left-trim
cddaar nintersection string-right-trim
cddadr ninth string-trim
cddar notany sublis
cdddar notevery subseq
cddddr nreconc subsetp
cdddr nreverse subst
cddr nset-difference subst-if
concatenate nset-exclusive-or subst-if-not
copy-alist nsublis substitute
copy-list nsubst substitute-if
copy-seq nsubst-if substitute-if-not
copy-tree nsubst-if-not subtypep
count nsubstitute tailp
count-if nsubstitute-if tenth
count-if-not nsubstitute-if-not third
delete nth tree-equal
delete-duplicates nthcdr typep
delete-if nunion unexport
delete-if-not pairlis union
eighth position unuse-package
elt position-if use-package
every position-if-not values-list
export pprint write
fifth prin1 write-to-string
fill prin1-to-string
Unless future-checking is automated somehow, all of the above functions
will have to be rewritten in terms of functions that do check for futures,
or their arguments will have to be checked in ways that might cause extra
computation and/or waiting to occur.
∂08-Mar-87 0900 JMC
final problems and formalization problems
∂08-Mar-87 1050 VAL proposal
Please look at the changes I made in the proposal, p. 6 of arpa87.tex[1,val].
I reordered the material in the background section, removed repetitions
and added a discussion of the declarative style as a form of modularity.
I hope I haven't omitted anything important; for comparison, the old version
of that part of the proposal is in darpa.bak[1,val]. Another place I've
rewritten is the paragraph beginning with "On the basis of our work..." in
the last subsection.
Buckley apparently read our old draft by mistake; that would explain why he
didn't find the dates attached to the milestones.
We should remember to include all the appendices promised in the proposal.
Where can I find your expert systems paper?
∂09-Mar-87 0900 JMC
dahl
∂09-Mar-87 1023 RICHARDSON@Score.Stanford.EDU Faculty Meeting
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 10:23:28 PST
Date: Mon 9 Mar 87 10:10:19-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Faculty Meeting
To: buchanan@SUMEX-AIM.Stanford.EDU, feigenbaum@SUMEX-AIM.Stanford.EDU,
rwf@Sail.Stanford.EDU, golub@Score.Stanford.EDU, guibas@decwrl.dec.com,
jlh@Sonoma.Stanford.EDU, dek@Sail.Stanford.EDU, zm@Sail.Stanford.EDU,
jmc@Sail.Stanford.EDU, ejem@Sierra.Stanford.EDU, papa@Score.Stanford.EDU,
pratt@Navajo.Stanford.EDU, ullman@Score.Stanford.EDU,
nilsson@Score.Stanford.EDU
cc: bscott@Score.Stanford.EDU
Message-ID: <12285052758.10.RICHARDSON@Score.Stanford.EDU>
There will be a faculty meeting on Tuesday, March 10 at 3:30 (note time)
in MJH 252 to discuss the possible Binford reappointment. Copies of the
incoming letters are in my office for your perusal prior to the meeting.
-------
∂09-Mar-87 1029 ULLMAN@score.stanford.edu [Baruch Schieber <sbar%TAURUS.BITNET@wiscvm.wisc.edu>:]
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 10:29:18 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Mon, 9 Mar 87 10:25:58 PST
Date: Mon 9 Mar 87 10:12:11-PST
From: Jeffrey D. Ullman <ULLMAN@score.stanford.edu>
Subject: [Baruch Schieber <sbar%TAURUS.BITNET@wiscvm.wisc.edu>:]
To: fndsch@navajo.stanford.edu
Message-Id: <12285053098.45.ULLMAN@Score.Stanford.EDU>
I got a message from Baruch Scheiber, who says he has won a
Weizmann fellowship and wants to take it at Stanford.
My instinct is always to say "yes" to Weizmann winners.
All those I know who have come to SU--Dolev, Vardi, Upfal, and now Peleg,
have developed outstanding reputations.
They are almost free; we have to put up (1) an office, (2) $7K/year
"supplement", and (3) computer time, secretarial, etc.
To make matters more complicated, I have already pledged to Amotz Bar-Noy,
a student of Dolev's and the other Weizmann winner in CS, that he
could come next year. However, I have not heard back from him that he
accepts the offer. I'm not in a situation where I can be sure of
ANY funds to support Bar-Noy, although I suspect something will come thru.
To make things more complicated, I look at the file (Scheiber applied
for a position here) and the attached message, and I'm not sure how
terrific Scheiber is.
Perhaps the committee has an opinion on whether this applicant deserves
to be invited. If so, would you agree to backing up a pledge
of the supplement ($7K) against the gift funds that were received
for support of theory, assuming I could not get the money from
DARPA or elsewhere?
---jeff
---------------
Return-Path: <@wiscvm.wisc.edu:sbar@taurus.BITNET>
Received: from wiscvm.wisc.edu by SCORE.STANFORD.EDU with TCP; Sun 8 Mar 87 07:18:41-PST
Received: from taurus by wiscvm.wisc.edu on 03/08/87 at 09:19:19 CST
Received: by taurus (5.51/ta.1.3.R)
id AA26484; Sun, 8 Mar 87 17:21:31 +0200
Return-Path: <sbar@taurus.BITNET>
Date: Sun, 8 Mar 87 17:21:31 +0200
From: Baruch Schieber <sbar%TAURUS.BITNET@wiscvm.wisc.edu>
Message-Id: <8703081521.AA26484@taurus>
To: ullman@score.stanford.edu
Dear Prof. Ullman,
Thank you very much for your timely response.
Enclosed please find the research proposal I sent with my resume.
(I believe it is also included in my file.)
Sincerely yours,
Baruch Schieber
EFFICIENCY OF COMPUTATION
Following the technological developments of the past decades we
reached the point where the speed of hardware components is very
close to the physical lower bounds. Thus, it seems that the most
feasible way to increase the speed of computations substantially
is by making them more efficient. Inspired by this perception my
proposed research will focus on the following interlacing aspects
of computation theory.
(1) The design and analysis of efficient algorithms, mostly for
combinatorial optimization and graph problems.
(2) Parallel computation, focusing on the following subjects.
(i) The design of efficient parallel algorithms which work on
an abstract machine model known in the literature as PRAM.
(ii) Efficient simulation of the PRAM model by realistic machine
models. That is, simulating the PRAM model by machine models
which are feasible in the state of the art technology.
(3) The design and the implementation of efficient data structures.
(4) Complexity theory, mainly, considering lower bounds for the
amount of computation needed for solving certain problems in
various computation models.
The proposed research is strongly connected with my current
research. In my M.Sc. and Ph.D. theses I consider the design of
efficient parallel and distributed algorithms. (See references.)
[5] and [7] prove some lower bounds for the running time of
certain problems both in parallel and serial models. Also, [5]
and [6] describe efficient data structures for answering certain
on-line queries.
References
[1] B. Schieber and S. Moran,
"Parallel algorithms for finding maximum bipartite matchings
and maximum flow in 0-1 networks".
TR 352, Dept. of Computer Science, Technion (1985).
To appear in Journal of Parallel and Distributed Computing.
[2] Y. Maon, B. Schieber and U. Vishkin,
"Parallel Ear Decomposition Search (EDS) and st-numbering in graphs".
Proc. 2nd Aegean Workshop on Computing, LNCS 227, Springer-Verlag
(1986), pp. 34-45. To appear in Theoretical Computer Science.
[3] B. Schieber and S. Moran,
"Slowing sequential algorithms for obtaining
fast distributed and parallel algorithms: maximum matchings".
TR 11979 (#53967), IBM J. Watson Research Center, Yorktown (1986),
also in Proc. 5th ACM SIGACT-SIGOPS Symp. on Principles of
Distributed Computing (1986), pp. 282-292.
[4] G.M. Landau, B. Schieber and U. Vishkin,
"Parallel construction of a suffix tree".
TR 53/86, The Moise and Frida Eskenasy Institute of Computer Science,
Tel Aviv University (1986). To appear in Proc. 14th ICALP, 1987.
[5] N. Alon and B. Schieber,
"Optimal preprocessing for answering on-line product queries".
Extended abstract.
[6] B. Schieber and U. Vishkin,
"On finding lowest common ancestors: simplification and
parallelization". TR 63/87, The Moise and Frida Eskenasy Institute
of Computer Science, Tel Aviv University (1987).
[7] B. Schieber and U. Vishkin,
"An optimal parallel algorithm for the All Nearest Neighbor
problem for convex polygons". In preparation.
-------
∂09-Mar-87 1106 VAL re: proposal
[In reply to message rcvd 08-Mar-87 16:01-PT.]
Do we want to include only the main body of the expert system paper, or
the answers to questions and the panel discussion as well? I suggest
using only the main part.
∂09-Mar-87 1123 VAL re: proposal
[In reply to message rcvd 09-Mar-87 11:11-PT.]
Are we ready to produce the final version for mailing to DARPA? What is the
situation with the part Les was working on? Are we going to include
information on our planned interaction with Rockwell? (I understand
Buckley is going to give us a paragraph on that subject.) I was trying to
assemble the whole thing with the appendices, and then it occured to me that
maybe I should wait with that.
∂09-Mar-87 1143 RA Mitch Ross
Mitch Ross from the University of Alaska is in town and would like to see
you. He will stop by your office around 2:00pm today. Will you be here?
∂09-Mar-87 1144 RA Ron Gatterdam
Ron Gatterdam from the University of Alaska called to find out about your
travel plans to Alaska. His tel. (907) 474 6174.
∂09-Mar-87 1152 PAPA@score.stanford.edu Visit by B. Natarajan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 11:52:03 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Mon, 9 Mar 87 11:50:19 PST
Date: Mon 9 Mar 87 11:50:18-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Visit by B. Natarajan
To: fndsch@navajo.stanford.edu, binford@score.stanford.edu,
genesereth@score.stanford.edu
Message-Id: <12285070958.37.PAPA@Score.Stanford.EDU>
Balas Natarajan is a student of Hopcroft spending his first year at CMU, the
Robotics Institute. The Foundations Search Committee is interviewing him
next Thursday March 12 for a position at Stanford. He is interested in some
formal aspects of Robotics and Learning. His talk (at 12:30 at MJH 352) is on
``the automatic design of parts orienters''. His schedule is shown below:
10:00-10:30 Papadimitriou MJH 332.
10:30-11:00
11:00-11:30 Guibas MJH 333
11:30-12:00
12:00-12:30 Fast food with Papadimitriou
12:30- 1:30 Talk at MJH 352 (AFLB)
1:30- 2:00
2:00- 2:30 Knuth MJH 328
2:30- 3:00
3:00- 4:00 Graduate students, MJH 352
4:00- 4:30
4:30- 5:00
6:00 Dinner with Papadimitriou
Please let me know which of the open slots is most convenient for you to
meet with him, and give me a second choice as well. Also tell me if you
can join us for a fast lunch or dinner.
---Christos.
-------
∂09-Mar-87 1201 QIAN@Score.Stanford.EDU Prof. Tang's visit
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 12:01:24 PST
Date: Mon 9 Mar 87 12:00:17-PST
From: Xiaolei Qian <QIAN@Score.Stanford.EDU>
Subject: Prof. Tang's visit
To: zm@Sail.Stanford.EDU, dcl@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12285072777.48.QIAN@Score.Stanford.EDU>
Prof. C.S.Tang from China is going to visit Stanford Mar.10 and Mar.11.
He would like to know if it is convenient for him to drop in sometime.
Thank you.
--Xiaolei
-------
∂09-Mar-87 1213 VAL new paper on the Yale shooting
To: JMC, SJG
I just received a new paper on the Yale shooting, by Brian Haugh, a student
at the University of Maryland. It seems interesting, and I left copies in
your mailboxes.
Vladimir
∂09-Mar-87 1406 RA Sanders
A Mr. Sanders called 3-9164. He has a question to you re miniturization
of an encyclopedia.
∂09-Mar-87 1434 RA be back
I am going to the Business School; will be back in 30 min.
∂09-Mar-87 1517 MAYR@Score.Stanford.EDU new course: Topics in Algebraic Computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 15:17:54 PST
Date: Mon 9 Mar 87 15:15:31-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: new course: Topics in Algebraic Computation
To: nilsson@Score.Stanford.EDU, reges@Score.Stanford.EDU,
igs@Sail.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12285108317.46.MAYR@Score.Stanford.EDU>
I think it is a wonderful (and overdue) idea to have a course on algebraic
computation like the one proposed here.
However, since this is a first shot at establishing such a course here,
I hesitate to list it in Courses and Degrees now. If it turns out to be
successful and the people involved feel that they want to commit themselves
to teaching a course on this topic in the long (medium?) term I would suggest
to formally add the course to the curriculum at that point.
At any rate, and independent from the above, every effort should be made
(electronic and other announcements) to make the course offering known to
the students. Also, when scheduling the course, care should be taken to
avoid overlap with other courses of interest to the intended audience.
Since much of the time scheduling is still in a state of flux we probably
have to wait a bit until we can determine a good time (possibly even
quarter) when the course should be taught.
-ernst
-------
∂09-Mar-87 1701 REGES@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 17:01:33 PST
Date: Mon 9 Mar 87 16:59:44-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: re: new course: Topics in Algebraic Computation
To: JMC@Sail.Stanford.EDU
cc: MAYR@Score.Stanford.EDU, nilsson@Score.Stanford.EDU, IGS@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 9 Mar 87 15:40:00-PST
Office: CS-TAC 22, 723-9798
Message-ID: <12285127290.13.REGES@Score.Stanford.EDU>
I have a slight variation to John's proposal. When we know of an experimental
course at catalogue copy time, we can add it, but we give it a 400 number. If
we can also let people know that 400-level courses are not yet part of the
"guaranteed ongoing curriculum" (as if we had such a thing), then presumably
people will not come to depend on these experimental courses.
-------
∂09-Mar-87 2008 NILSSON@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 20:08:20 PST
Date: Mon 9 Mar 87 20:07:14-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: re: new course: Topics in Algebraic Computation
To: JMC@Sail.Stanford.EDU
cc: REGES@Score.Stanford.EDU, MAYR@Score.Stanford.EDU, IGS@Sail.Stanford.EDU,
NILSSON@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 9 Mar 87 19:23:00-PST
Message-ID: <12285161423.15.NILSSON@Score.Stanford.EDU>
John's motion (amended by Stuart) sounds just fine to me. If the curric
committee is willing to take it on itself to recommend this policy, I'd
be willing to approve it, and we'll assume that the faculty will be
happy with the idea. -Nils
-------
∂09-Mar-87 2037 MAYR@Score.Stanford.EDU re: new course: Topics in Algebraic Computation
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Mar 87 20:37:16 PST
Date: Mon 9 Mar 87 20:36:03-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: re: new course: Topics in Algebraic Computation
To: NILSSON@Score.Stanford.EDU, jmc@Sail.Stanford.EDU,
reges@Score.Stanford.EDU, igr@Sail.Stanford.EDU
In-Reply-To: <12285161423.15.NILSSON@Score.Stanford.EDU>
Message-ID: <12285166669.12.MAYR@Score.Stanford.EDU>
I am perfectly happy with the motion as amended by Stuart, and I should
assume so is the committee.
Let's find a 4xx number, and a timeslot for the course.
-ernst
-------
∂10-Mar-87 0323 CRISPIN@SUMEX-AIM.STANFORD.EDU Re: China
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 03:23:18 PST
Date: Tue 10 Mar 87 03:23:40-PST
From: Mark Crispin <Crispin@SUMEX-AIM.STANFORD.EDU>
Subject: Re: China
To: JMC@SAIL.STANFORD.EDU
cc: su-etc@SAIL.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Mar 87 00:34:00-PST
Postal-Address: 1802 Hackett Ave.; Mountain View, CA 94043-4431
Phone: +1 (415) 968-1052
Message-ID: <12285240873.15.CRISPIN@SUMEX-AIM.STANFORD.EDU>
Answer to JMC:
Both the government of the mainland of China and the government
of Taiwan province claim to be the sole legitimate government of all
of China. Neither accepts the existance of Taiwan as an independent
nation. If one is put to the question as to which government has a
better claim to being the government of all of China, the only answer
has to be the government of the People's Republic of China in Bejing.
If it comes to a military confrontation, I think the best thing
the US could do is to make sure that our friends in the ROC government
who fear reprisals after the takeover are granted safe haven in the
US. We've granted safe haven to all sorts of scoundrels (e.g. Marcos)
so why shouldn't we grant safe haven to people who by and large are
reasonable, hard-working, and honest?
A better solution to the problem would be for the two sides to
open negotiations. The BBoard flames from our Taiwanese friends
confirm it -- they seem to consider everyone in the PRC government
as being evil "commie" sub-humans who should be exterminated like
cockroaches. I find it difficult to swallow such a categorization.
It it impossible of me to consider people like Dr. Ma Haide (George
Hatem) as being evil. I've met him; he glosses over the flaws in
Chinese society but his dedication to improving the human condition
is real.
A start would be for the two Chinese governments to open trade,
postal, and diplomatic links and tolerate each other's international
recognition. It is painfully obvious that there will not be a peaceful
reunification of China within most of our lifetimes, so whether the
governments like it or not there will be "two Chinas" for a long time
to come. No one would benefit by a forcible reunification of China,
except perhaps for Chinese undertakers.
More than anything else, the only chance for peace AND freedom
is for the Chinese people to bury old blood-feuds along with the dead
men who fought them. Mao and Chiang are dead. The younger Chiang and
Deng will soon be dead. It's pretty stupid to carry on dead men's
quarrels.
What happens in Hongkong will be quite interesting. The PRC
government would be idiots if they change Hongkong. It is the PRC's
most important trade center. They already own much of the businesses
there. Cathay Pacific is now 12% owned by the PRC but they still fly
to Taipei.
-------
∂10-Mar-87 0358 REGES@Score.Stanford.EDU industrial lecturers
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 03:58:25 PST
Date: Tue 10 Mar 87 03:57:22-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: industrial lecturers
To: jmc@Sail.Stanford.EDU
cc: dewerk@Score.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12285247008.11.REGES@Score.Stanford.EDU>
John,
I notice from the catalogue materials that next year's industrial
lecturers will be Cynthia Dwork, Paul Haley, and John Sowa. I have added
PEOPLE entries for all three, but can you give us some contact information
for the database? Gerda DeWerk will be contacting them later this year to
process their appointments for next year.
-------
∂10-Mar-87 0401 REGES@Score.Stanford.EDU correction
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 04:01:32 PST
Date: Tue 10 Mar 87 04:00:29-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: correction
To: jmc@Sail.Stanford.EDU
cc: dewerk@Score.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12285247575.11.REGES@Score.Stanford.EDU>
On more careful reading I find that you did tell us:
John Sowa is from IBM Systems Research Institute
Cynthia Dwork is from IBM Almaden Research Center
Paul Haley is from Inference Corporation
If you have further contact info (e.g., phone numbers or email addresses),
please pass them along to Gerda.
-------
∂10-Mar-87 0856 RA
gelfon.re2
John,
I could not find gelfon.re2[let,jmc]. Can you help?
Thanks,
∂10-Mar-87 1009 PAPA@score.stanford.edu Natarajan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 10:09:43 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 10 Mar 87 10:06:49 PST
Date: Tue 10 Mar 87 10:06:52-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Natarajan
To: fndsch@navajo.stanford.edu
Message-Id: <12285314275.38.PAPA@Score.Stanford.EDU>
Here is his schedule for now. Let me know if you can join us for a meal, or
if you can see him in one of the free slots.
---Christos.
-------
∂10-Mar-87 1037 VAL Proposal
Here are 2 paragraphs I included in the description of the database project:
The use of such a powerful and purely declarative mechanism of
knowledge representation as classical logic extended by circumscription
will allow us to achieve a high degree of modularity. Reasoning programs
which have different goals and use different internal representations of
information and different heuristics will all be able to use the same database.
They will be able to share knowledge with each other by exchanging messages
in the language of the database without taking into account the internal
structure of other participants of the dialogue. Humans who want to understand
these messages will not have to know anything at all about the structure of
the programs which send them.
These features of the proposed commonsense database project will make it
an important step in the development of the idea of the {\it Common Business
Communication Language} (CBCL), described by McCarthy (1982) in the
following way:
``Any organization should be able to communicate with any other
without pre-arrangement over ordinary dial-up telephone connections$\dots$
The system should be open ended so that as programs
improve, programs that can at first only order by stock numbers can
later be programmed to inquire about specifications and prices and
decide on the best deal. This requires that each message be
translatable into a human-comprehensible form and that each computer
have a way of referring messages it is not yet programmed to
understand to humans$\dots$
CBCL is strictly a communication protocol. It should not
presuppose any data-base format for the storage within machines of
the information communicated, and it should not presuppose anything
about the programs that use the language. Each business using the
language would have a program designed to use the particular part
of CBCL relevant to its business communications. Thus CBCL presupposes
nothing about the programs that decide when to order or what orders
to accept.
CBCL is not concerned with the low-level aspects of the
message formats, i.e., what kinds of bit streams and what kinds of
modems, except to remark that the system should avoid traps in these
areas, and the users should be able to change their systems
asynchronously.''
∂10-Mar-87 1206 masahiko%nttlab.ntt.junet%utokyo-relay.csnet@RELAY.CS.NET Re: trip
Received: from RELAY.CS.NET by SAIL.STANFORD.EDU with TCP; 10 Mar 87 12:06:32 PST
Received: from relay2.cs.net by RELAY.CS.NET id ab21956; 10 Mar 87 13:49 EST
Received: from utokyo-relay by RELAY.CS.NET id aa18219; 10 Mar 87 13:45 EST
Received: by u-tokyo.junet (4.12/4.9J-1[JUNET-CSNET])
id AA26070; Wed, 11 Mar 87 03:37:55+0900
Received: by titcca.cc.titech.junet (4.12/6.2Junet)
id AA16229; Wed, 11 Mar 87 02:42:44 jst
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Wed, 11 Mar 87 00:16:18 jst
Date: Wed, 11 Mar 87 00:16:18 jst
From: Masahiko Sato <masahiko%nttlab.ntt.junet%utokyo-relay.csnet@RELAY.CS.NET>
Message-Id: <8703101516.AA04888@nttlab.ntt.junet>
To: JMC@SAIL.STANFORD.EDU
In-Reply-To: John McCarthy's message of 07 Mar 87 1633 PST
Subject: Re: trip
Thank you for accepting to give a general talk at Tohoku University.
As you might know, in Japan, school year begins in April, and at Tohoku
University it begins on April 6. We are now having school holidays
until then. So, we would like to avoid to have your your talk before
April 7.
When I first talked with Nori Suzuki, he said that he would be
available anytime after April 6. Today, I talked with him again.
This timie he said that he would be available only on April 9 or 10.
He seems to be extemely busy. He also said that someone else at IBM
will welcome you even if he will be out.
Today I called Prof. Takasu. He said he would welcome you on March
30, but he would go to Tokyo on March 31.
According to Shigeki Goto, he and Ikuo Takeuti will welcome you on
April 2 or 3.
I understand that you will visit ICOT on April 7.
So, I think the following plan would satisfy all the conditions above.
1. March 29. Arrive Osaka.
2. March 30. Visit Prof. Takasu and others.
3. March 31 or April 1 or 2. Move from Kyoto to Tokyo.
4. April 2 or 3. Visit NTT.
5. April 6. Visit IBM.
6. April 7. Visit ICOT.
7. April 8. Move from Tokyo to Sendai in the moring, and see us in
the afternoon.
8. April 9. Your lecture for general audience.
9. April 10. Move from Sendai to Tokyo.
How do you think about this plan? You will be able to find time to
see Professor Goto in Tokyo. You can leave Tokyo either on April 10
or 11, and you will perhaps be able to see Nori Suzuki on April 10 if
you like.
Please let me know if this plan would be ok for you. Also let me know
the title of your talk at Tohoku Univ. Is the tentative title "Lisp
and AI" ok?
** masahiko **
P.S. By the way, are you and/or Carolyn interested in receiving
electronic mails while you will be in Japan. If you like, I will ask
Shigeki to set up accounts for you at NTT. Then by forwardin your
mails to NTT, you will be able to receive (and also send) mails when
you visit NTT and when you will be in Sendai.
∂10-Mar-87 1233 VAL re: Proposal
[In reply to message rcvd 10-Mar-87 11:13-PT.]
I gave the current version of the proposal, with the appendices and the
budget, to Rutie. Please tell her what the cover letter should say, and she'll
be ready to mail it.
∂10-Mar-87 1234 VAL
My 3 problems for the final are in final.tex[1,val]
∂10-Mar-87 1243 CLT thursday
I keep forgetting to mention, I would like to
play flute with GLB Thursday - soon after 8pm.
Is this ok?
∂10-Mar-87 1318 PAPA@score.stanford.edu Re: Natarajan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 13:11:12 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 10 Mar 87 13:09:40 PST
Date: Tue 10 Mar 87 13:09:42-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Re: Natarajan
To: fndsch@navajo.stanford.edu
In-Reply-To: <12285314275.38.PAPA@Score.Stanford.EDU>
Message-Id: <12285347559.26.PAPA@Score.Stanford.EDU>
Sorry about that, it hadn't happened to me for a while.
Here is Natarajan's promised schedule:
10:00-10:30 Papadimitriou MJH 332.
10:30-11:00 Pratt MJH 428
11:00-11:30 Guibas MJH 330
11:30-12:30 Fast food with Papadimitriou
12:30- 1:30 Talk at MJH 352 (AFLB)
1:30- 2:00 FREE
2:00- 2:30 Knuth MJH 328
2:30- 3:00 Mayr MJH 334
3:00- 4:00 Graduate students, MJH 352
4:00- 4:30 FREE
4:30- 5:00 Jeff Ullman MJH 338
6:00 Dinner with Papadimitriou
Company for the meals is sought.
---Christos.
-------
∂10-Mar-87 1351 SJG
did you leave your coat at my place?
∂10-Mar-87 1409 AIR EBOS
To: JMC, VAL
I. "Editor base" property was developed by Richard Stallman and now is
the part of a standart GNU EMACS.
Possible development path:
a) Current GNU EMACS does not handle properly prompts from the user programs;
b) It does not handle properly multy-line input to the OS.
II. Non standart characters.
a) Multiple keyboard were implemented (Russian, Greeck, Math);
b) Software to support large character set (with the Russian, Greeck and Math
symbols) was developed.
Possible development:
a) Software to really support multiple character sets, where one of the file
attribute would be its charachter set.
b) Ability by EMACS to handle multiple character sets, and esspecially the
ability to have files with the different character sets simultaneously on
the screen in different windows.
∂10-Mar-87 1443 RA leaving
I have to leave now to go to SF. Sorry about that, but this is completely
unexpected and couldn't be changed.
∂10-Mar-87 1452 VAL Non-monotonic seminar: NO MEETING this week
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
There will be no meeting on Thursday, March 12.
Vladimir
∂10-Mar-87 1500 VAL
I've made the corrections in final.tex[1,val]
∂10-Mar-87 1607 CLT soup
If you want to get soup ingredients tonight
or tomorrow morning, I will have Hazel make soup
tomorrow.
1 large can chicken soup
1.5 pounds veal or lamb stew meat
2 ears corn
2 zucchini
3 tomatoes
maybe chinese pea pods ?
∂10-Mar-87 1651 L.LILITH@OTHELLO.STANFORD.EDU AIDS patients as reservoirs of infection
Received: from OTHELLO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 16:51:42 PST
Date: Tue 10 Mar 87 16:51:39-PST
From: Pilar Ossorio <L.LILITH@OTHELLO.STANFORD.EDU>
Subject: AIDS patients as reservoirs of infection
To: jmc@SAIL.STANFORD.EDU, su-etc@OTHELLO.STANFORD.EDU
Message-ID: <12285387962.233.L.LILITH@OTHELLO.STANFORD.EDU>
JMC, this message is in response one of your recent messages (06 March)
in which you express concern about the possibility that people with
AIDS may serve "as reservoirs for infections to which everyone is
susceptible." and that "An increased susceptibility to ordinary infections
would not be diagnostic of AIDS but might well constitute a danger to others."
Roland is correct in saying that people who are immunosuppressed due to HTLV-3
infection are at risk for contracting opportunistic infections and do not
seem to be at a significantly greater risk for contracting colds or the flu
than the general population. Patients with AIDS are getting sick from things
that everyone is commonly exposed to but doesn't usually get sick from.
AIDS patients get sick because their immune system isn't functioning properly
and if your immune system is healthy or anywhere near normal you won't get
what they have. People who are immunosuppressed for other reasons, such as
steroid therapy, are also at risk for opportunistic infections.
Even if AIDS patients were at greater risk for common colds or measles
or what have you, the chances of your getting it from them are no
greater than the chances of your getting it from anyone else; it
isn't as though the infection would be any more virulent because a
person with AIDS had it.
-LILITH-
PS. I think I publicly flamed you a few days back when I meant to
be flaming Lyn. If you *weren't* the person who made the comment
about not wanting to engage in "latex sex" just because some people
have AIDS then I publicly apologize.
-------
∂10-Mar-87 1720 BSCOTT@Score.Stanford.EDU [Betty Scott <BSCOTT@Score.Stanford.EDU>: Today]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 17:20:26 PST
Date: Tue 10 Mar 87 17:15:32-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: [Betty Scott <BSCOTT@Score.Stanford.EDU>: Today]
To: JMC@Sail.Stanford.EDU, ZM@Sail.Stanford.EDU, Eppley@Score.Stanford.EDU,
BScott@Score.Stanford.EDU
Message-ID: <12285392311.44.BSCOTT@Score.Stanford.EDU>
For your information. I will be glad to discuss this with you if you wish.
Betty
---------------
Mail-From: BSCOTT created at 10-Mar-87 17:14:09
Date: Tue 10 Mar 87 17:14:08-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Today
To: RA@Sail.Stanford.EDU
cc: BScott@Score.Stanford.EDU
Message-ID: <12285392057.44.BSCOTT@Score.Stanford.EDU>
Rutie, once again I remind you that it is not satisfactory for you to just
announce that you are leaving, for whatever reason, unexpected or not. In
the future unless either LaDonna or I am contacted (in addition to approval
by Zohar and John, in advance), the time will be deducted from your salary.
I regret having to send this message, but I am not getting the required
cooperation from you. In the future, no absence is excused unless you have
prior approval.
Betty
-------
-------
∂10-Mar-87 1747 DLIU@Sierra.Stanford.EDU The ROC.PRC debate
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 17:46:28 PST
Date: Tue 10 Mar 87 17:45:24-PST
From: David Liu <DLIU@Sierra.Stanford.EDU>
Subject: The ROC.PRC debate
To: jmc@Sail.Stanford.EDU
Message-ID: <12285397747.20.DLIU@Sierra.Stanford.EDU>
John
I have been sending in several message to correct Mark Crispin's pro-
communist, anti-ROC messages. I have also read your comment and it is
a pleasure to know that people from Taiwan can have friend like you.
It seems that Crispin is quietly switching topics now. You are right that
he seems to be changing. He is also one of those type who was fooled
by pro-communist readings and gradually turns around. I have seen
one of the Nobel Physics Prize winner (Dr. C.N. Yang) was one of that type
also. He commented one time in 1974 that the Cultural Revolution in Communist
China did no harm to the people in China. I can only say that the communist
propaganda did a really good job.
It is also intersting to note the thundering quietness of all the Mainland
China visitors and students through this discussion. That also is a
some very important message.
Regards,
David Liu
←
-------
∂10-Mar-87 1750 L.LILITH@OTHELLO.STANFORD.EDU B cells and T cells
Received: from OTHELLO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 17:49:48 PST
Date: Tue 10 Mar 87 17:49:54-PST
From: Pilar Ossorio <L.LILITH@OTHELLO.STANFORD.EDU>
Subject: B cells and T cells
To: jmc@SAIL.STANFORD.EDU, su-etc@OTHELLO.STANFORD.EDU
Message-ID: <12285398568.233.L.LILITH@OTHELLO.STANFORD.EDU>
This message is also in response to a message by JMC (06-March,
I think) in which he said,
"Anyway I didn't really understand the part of the previous message about
T-cells and B-cells and AIDS destroying T-cells but not B-cells. Is it
really true that the opportunistic infections that AIDS people get are
fought by exactly the T-cells and that all ordinary infections are fought
by exactly the B-cells? This seems strange, and I would be grateful for a
reference to an article explaining it."
What you need is a good basic immunology text, because this is what
immunology is all about. But, I'll try to do my best at a short, simple
explanation (since I have TAed one of the immunology courses I may
even be able to make this comprehensible!). Your body's immune system
has two types of defense, humoral immunity mediated by antibodies and
cellular immunity mediated by some T-cells and other "effector" cells.
B-cells produce antibodies which are effective in protecting you (sometimes)
from foreign particles and organisms which are in the blood or sometimes
on membranes. Antibodies are not effective at killing or "defusing"
organisms which have gotten inside of cells.
Some T-cells are effector cells, which means that they participate directly
in killing foreign organisms or host cells which are harboring foreign
organisms. So, T-cells can be effective in defending the body from
intracellular agents such as viruses, some bacteria, and some other
intracellular parasites. However, there are other T-cells, called helper
cells, which participate indirectly in the body's defenses. T helper cells
help the B cells to make antibodies and probably help other T cells to perform
their functions.
There are also other kinds of cells in the immune system that do something
similar to the effector T cells (also known as T killer cells), but we don't
need to discuss them now.
The HTLV-3 virus (which causes AIDS), affects the immune system by attacking
the T helper cells. According to what we know of how the immune system works,
according to the best theories we have on the relationships between the
components of the immune system, a virus that knocks out the T helper cells
should affect all the functions of the immune system, including the B cell
functions. However, even before AIDS existed, or before we knew AIDS existed,
it was recognized that patients who were immunosuppressed due to other
diseases or due to chemotherapy, were particularly susceptible to certain
kinds of diseases. Different kinds of immunosuppression may be strongly
associated with certain characteristic opportunistic pathogens. For example,
people who are taking cortisone are particularly susceptible to infections
by a type of yeast called Candida albicans (may not be spelled correctly),
whereas people with AIDS are particularly susceptible to pneumocystis
pnuemonia. People who are not immunosuppressed are also being exposed to
these pathogens but are not getting disease as a result. It is still quite
a mystery as to why immunosuppressed people are particularly susceptible to
certain characteristic diseases and don't just come down with everything on
earth with equal frequency. Several years ago, I worked with a doctor
here at Stanford hospital who was investigating this very question... he's
still working on it.
I hope this gives you an idea about what we do and don't know about the
process of disease caused by HTLV-3. If you have more questions feel free
to ask and I'll see what I can do.
-LILITH-
PS. This message has gotten long and I have to go so I'm not going to
proofread it. There are probably many, many spelling errors but please
ignore them. I may not know how to spell but I do know immunology and
microbiology (oh blech, you say, not another of those illiterate
scientists! Well, hopefully I'm not that bad.)
-------
∂10-Mar-87 1834 DLIU@Sierra.Stanford.EDU re: The ROC.PRC debate
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 18:33:53 PST
Date: Tue 10 Mar 87 18:34:46-PST
From: David Liu <DLIU@Sierra.Stanford.EDU>
Subject: re: The ROC.PRC debate
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Mar 87 17:53:00-PST
Message-ID: <12285406734.9.DLIU@Sierra.Stanford.EDU>
John
{In reply to your message send Tue Mar 87 18:06:40}
Good point. I have found most of them are not so interested in talking
about politics (probably for the reasons you have cited.) One of the person I
know expressed worries about the crack-down of student freedom movement
but quickly switched topics.
D.L.
-------
∂10-Mar-87 1841 L.LILITH@OTHELLO.STANFORD.EDU re: AIDS patients as reservoirs of infection
Received: from OTHELLO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 18:35:59 PST
Date: Tue 10 Mar 87 18:36:07-PST
From: Pilar Ossorio <L.LILITH@OTHELLO.STANFORD.EDU>
Subject: re: AIDS patients as reservoirs of infection
To: JMC@SAIL.STANFORD.EDU
cc: L.LILITH@OTHELLO.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Mar 87 17:07:00-PST
Message-ID: <12285406981.233.L.LILITH@OTHELLO.STANFORD.EDU>
You are correct that in hospitals and elsewhere there are immunosuppressed
patients. All of us are a threat to immunosuppressed people because
we are all carrying organisms which will make them sick and not us. AIDS
patients are some of those immunosuppressed people. If anything, AIDS
patients are at risk from us and not the other way around. If a doctor
has a communicable disease that doctor shouldn't be at work until she/he
is well and not contageous, this goes for a doctor with AIDS or any other
doctor with a cold, the flu, herpes whitlow (herpes on the hand or some
other non-mucosal surface, a problem of many doctors and nurses), etc.
But if a doctor who has AIDS does not have any other infection at the
time, I personally (my opinion, ok.) don't see any reason why they
shouldn't be seeing patients. Or at least, fear of passing some non-HTLV
infection would not seem to be a consideration at that time. There are
plenty of doctors out there who have genital herpes or cancer or ...
who are practicing as long as their disease isn't contagious and doesn't
affect their ability to perform.
I'm not sure I know of a specific journal article which refers to the
problem of protecting the public from opportunistic infections that
are normally associated with immunosuppressed patients since, as I
said, the problem is actually how to protect them from us. Did you
ever think that there could be a problem of a patient with Hodgkins
disease or a transplant being a danger to the rest of us? (Hodgkins
is a cancer of the lymphoid cells, which includes T and B cells, and
so Hodgkins patients are often immunosupressed.)
I am doing my Ph.D. thesis on a organism called Toxoplasma gondii which is
an opportunistic pathogen in AIDS patients and transplant patients. When I
began work on this organism a couple of years ago, people were only beginning
to realize that it was an opportunistic organism. In the US anywhere
between 15 and 60% of people are infected with this parasite (depending on
what part of the country you are in and whose statistics you believe.) and
in France and several third world countries as many as 80% of people are
infected. The key thing is that this parasite is almost totally benign
and most people live and die without ever being aware that they have it.
However, if you contract it in utero it causes severe birth defects, and
if you are immunosuppressed it will kill you unless you receive the proper
medication. This is a case were there is something that many many people
carry, but if you have AIDS you could die from it. It is believed that
most AIDS patients get the disease because their infection reactivates and
can no longer be kept in check by their damaged immune systems.
Enough already.
Ciao.
-------
∂10-Mar-87 1851 L.LILITH@OTHELLO.STANFORD.EDU re: AIDS patients as reservoirs of infection
Received: from OTHELLO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 10 Mar 87 18:51:12 PST
Date: Tue 10 Mar 87 18:51:15-PST
From: Pilar Ossorio <L.LILITH@OTHELLO.STANFORD.EDU>
Subject: re: AIDS patients as reservoirs of infection
To: JMC@SAIL.STANFORD.EDU
cc: L.LILITH@OTHELLO.STANFORD.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Tue 10 Mar 87 17:07:00-PST
Message-ID: <12285409734.233.L.LILITH@OTHELLO.STANFORD.EDU>
One more thing: If I were you I would depend on my *good* sense as much
as I would depend on the conclusions drawn by the medical community.
Definitely, use their data, look at their arguements, even look at their
conclusions, but don't trust them to be anything more than a group of
human beings with their own prejudices and their own considerable self
interest to protect. There has been plenty of misery perpetrated by
doctors ( who took a hundred years or more to decide to wash their hands
before delivering babies and were therefore responsible for untold numbers
of deaths from purpural infection all because they didn't want a bunch of
midwives telling them what to do!). The medical community has so much
invested in being the one and only keeper of the public health that they
will defend each other's stupidity and support each other's ignorance
rather than seem like they aren't in control. Well, maybe not
always, but often. There are a heck of a lot of doctors out there who
practice drunk or on drugs, who get a lot of money to do worthless science,
or who are just plain human and make mistakes no matter how good they are
at their job and how concientious they are.
-LILITH (ok. that's really all)-
-------
∂11-Mar-87 0108 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab [ARIMA%ICOT20.ICOT@icot.icot.junet: On Prof.McCarthy]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 01:08:40 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Wed 11 Mar 87 01:01:07-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Wed 11 Mar 87 12:54:13
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Wed, 11 Mar 87 12:54:28 jst
Date: Wed, 11 Mar 87 12:54:28 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8703110354.AA10891@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20
Subject: [ARIMA%ICOT20.ICOT@icot.icot.junet: On Prof.McCarthy]
Mr. Arima at ICOT asked me to forward the following message to you.
** masahiko **
Return-Path: <ARIMA@ICOT20.icot.junet>
Date: Wed 11 Mar 87 10:30:51
From: ARIMA%ICOT20.ICOT@icot.icot.junet
Subject: On Prof.McCarthy
To: masahiko@nttlab.ntt
Dear Sato
Sorry, I have not got his reply yet. I'm afraid he did not read
my mail. So I want you to send him the follwing mail again, please
do so.
----------------------------------------------------------------
Dear Prof. McCarthy
Prof. Masahiko Sato informed us of your visit to ICOT. It is our great
pleasure to meet you. We are always encouraged in our studies by your
remarkable contributions to AI fields.
Now, we would like to arrange your plan at ICOT. The following is our
proposal for your visit to ICOT. Please let us know your opinions with
respect to this.
Visiting plan to ICOT
1.(date) April 7 [Tue]
2.(approximately 2 hours in the morning) Informal
discussions about "Non-monotonic Reasoning" with a few
persons, including Prof. Nakagawa and me (Arima), who are
strongly interested in it and studying it actually.
3.(approximately 2 hours in the afternoon) We would like
to have your lecture on your current research topics. The
attendance will be ICOT members and some othe researchers
who have interest in the topics.
Please inform us what title your lecture is and what you
use in the lecture (OHP, slide projector, etc).
We are looking forward to seeing you in Tokyo and discussing some problems
of AI with you.
Sincerely yours,
Jun Arima
Researcher
arima%icot.jp@csnet-relay
cc: Dr. Furukawa ( Deputy Director, Research Center )
cc: Dr. Ito ( Chief, First Research
-------
∂11-Mar-87 0944 RA Steve Balter, Sun Microsystems
Balter called re asking for your help in finding good people for the following
open positions:
1. Product marketing manager for AI products.
2. Computr aided software engineering. High level manager, director.
His tel. (415) 354 4612
∂11-Mar-87 1024 PERLAKI@Sushi.Stanford.EDU Check
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 10:24:40 PST
Date: Wed 11 Mar 87 10:22:54-PST
From: Agnes Perlaki <PERLAKI@Sushi.Stanford.EDU>
Subject: Check
To: Shankar@Score.Stanford.EDU, JMC@Sail.Stanford.EDU,
Ullman@Score.Stanford.EDU, Bjork@Score.Stanford.EDU
cc: perlaki@Sushi.Stanford.EDU
Message-ID: <12285579338.29.PERLAKI@Sushi.Stanford.EDU>
There is a check waiting for you at the reception desk.
-Agi
-------
∂11-Mar-87 1111 RA meeting today
To: eppley@SCORE.STANFORD.EDU
CC: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU, BS@SAIL.STANFORD.EDU
LaDonna,
I have a 4:00pm meeting today with Stanford's ombudsperson.
I will let the receptionist know and leave my name on the board.
Rutie
-----
∂11-Mar-87 1301 AIR ebos
Let me know when you are ready to have a meeting.
Arkady
∂11-Mar-87 1418 WEGMAN@yktvmh2.bitnet Visit
Received: from LINDY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 14:18:16 PST
Received: by lindy.STANFORD.EDU; Wed, 11 Mar 87 14:16:37 PST
Date: Wed, 11 Mar 87 14:18:15 PST
From: <WEGMAN@yktvmh2.bitnet>
Reply-To: WEGMAN%YKTVMH2.BITNET@forsythe.stanford.edu
To: JMC@sail.stanford.edu
Subject: Visit
Date: 11 Mar 1987 17:14:09-EST (Wednesday)
From: WEGMAN@YKTVMH2
To: JMC@SAIL.STANFORD.EDU
Subject: Visit
I am about to leave for Calif. where I will be for the next week, until
we meet. I realized that we didn't set a time. I'll try to reach you.
If I don't suceed, I will be at the CommonLisp meeting and at the Hyatt
during that time.
∂11-Mar-87 1457 rms@PREP.AI.MIT.EDU Another Macsyma-like situation.
Received: from PREP.AI.MIT.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 14:55:49 PST
Received: by PREP.AI.MIT.EDU; Wed, 11 Mar 87 18:01:49 EST
Date: Wed, 11 Mar 87 18:01:49 EST
From: rms@PREP.AI.MIT.EDU (Richard M. Stallman)
Message-Id: <8703112301.AA02937@prep.ai.mit.edu>
To: jmc@su-ai.arpa
Subject: Another Macsyma-like situation.
I have reports that BBN TCP was developed under an ARPA contract
that required the results to be given to ARPA, but that BBN is
refusing to do so and is licensing the software very expensively.
If BBN TCP were available, it might be very useful for the GNU project.
Perhaps your contacts at ARPA could tell you if there is any chance of this;
perhaps a request from you would encourage them to take action.
∂11-Mar-87 1456 CLT This week's Qlisp meeting
To: QLISP@SAIL.STANFORD.EDU
Time: Friday Mar 13, 11:00
Place: 252 Margaret Jacks
Topic: Igor and Lucid will provide pages describing semantics of Qlisp
primitives for us to discuss.
Question of the week:
In designing Qlisp algorithms, simulating Qlisp, and
instrumenting Qlisp programs, what are the relevant things
to measure and to be concerned about?
Resource contention?
Cost of process creation?
Optimal degree of parallelism?
∂11-Mar-87 1542 RICHARDSON@Score.Stanford.EDU Course Proposal
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 15:42:51 PST
Date: Wed 11 Mar 87 15:41:02-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: Course Proposal
To: shankar@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12285637252.19.RICHARDSON@Score.Stanford.EDU>
Charles Junkerman of the Dean's office in H & S called today regarding a
course proposal that you submitted. He wants to know if Nils knows about
this, if it will actually be taught and by whom it would be taught. Nils
indicated that he doesn't know anything about this, nor does Ernst Mayr
(the chair of the curriculum committee). Can you enlighten me?
Thanks,
Anne
-------
∂11-Mar-87 1544 RA leaving
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU
I am leaving now for my 4:00 appointment with the ombudsperson.
Rutie
-----
∂11-Mar-87 1546 paddstep@portia.STANFORD.EDU Eurisko...
Received: from PORTIA by SAIL.STANFORD.EDU with TCP; 11 Mar 87 15:46:39 PST
Received: by portia.STANFORD.EDU; Wed, 11 Mar 87 15:46:42 PST
Date: Wed, 11 Mar 87 15:46:42 PST
From: John Kallen <paddstep@portia.STANFORD.EDU>
Subject: Eurisko...
To: JMC@sail.STANFORD.EDU
A friend and I are interested in finding out more about the AI program
Eurisko. Where could I find out more about it?
TNX
John K{ll`n
∂11-Mar-87 1558 RICHARDSON@Score.Stanford.EDU re: Course Proposal
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 11 Mar 87 15:58:36 PST
Date: Wed 11 Mar 87 15:56:47-PST
From: Anne Richardson <RICHARDSON@Score.Stanford.EDU>
Subject: re: Course Proposal
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 11 Mar 87 15:48:00-PST
Message-ID: <12285640117.19.RICHARDSON@Score.Stanford.EDU>
Thanks for the info.
-Anne
-------
∂11-Mar-87 1810 LES re: Another Macsyma-like situation.
[In reply to message sent Wed, 11 Mar 87 18:01:49 EST.]
It looks to me as though rms is indulging in a standard form of confusion.
Whenever some organization develops things under government contracts,
they usually have to promise to make it available to the government at no
cost, but that is _not_ the same as making it available to the general
public at no cost. Without having read the BBN contract, I would guess
that BBN retained commercial rights to the software they developed, despite
the immorality of such situations from rms's viewpoint.
∂11-Mar-87 2325 Olasov.StudentNS@MIT-MULTICS.ARPA Common LISP mail litht
Received: from MIT-MULTICS.ARPA by SAIL.STANFORD.EDU with TCP; 11 Mar 87 23:25:42 PST
Acknowledge-To: Olasov@MIT-MULTICS.ARPA
Date: Thu, 12 Mar 87 02:22 EST
From: Olasov@MIT-MULTICS.ARPA
Subject: Common LISP mail litht
To: JMC@SAIL.STANFORD.EDU
Message-ID: <870312072228.788846@MIT-MULTICS.ARPA>
Hello,
I'd like to be placed on the Common Lisp mailing list, and
I'm not sure who to contact about it.
If you're the appropriate conta[C[C, could you place me on
the list? If not, could you forward this mail to the
appropriate party. (T If you don't know who the appropriate
person to do this might be could you return this to my
return path. Thanks,
MULTICS.MIT.EDU>
∂12-Mar-87 0838 MACMILK@Score.Stanford.EDU re: want to help name my sister's child?
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Mar 87 08:37:57 PST
Date: Thu 12 Mar 87 08:34:30-PST
From: Katie MacMillen <MACMILK@Score.Stanford.EDU>
Subject: re: want to help name my sister's child?
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 11 Mar 87 21:04:00-PST
Message-ID: <12285821747.23.MACMILK@Score.Stanford.EDU>
ah, but her first point was that since the other two had wierd
names, out of fairness this needed to have a wierd name also.
one of the saving graces of children having such names in santa
cruz, is that at school they are surrounded by other children with
unusual names. i was unhappy at age 12 or so to find out that
"katherine astrid" had been a bitterly argued decision that won
out over "astrid katherine", when i would've wanted to have been
known as astrid all that time. it's true, i COULD have changed my
name then or now, but it seemed a struggle not worth the gains.
at least with my sister's kids, i have complete faith and confidence
that she will continue to raise them believing fully in their own
capabilities, and that if she does so then what their names are will
not harm them and may give them more sense of uniqueness.
-katie
-------
∂12-Mar-87 0909 RA CS326 final
Shall I go ahead and xerox the finals?
Thanks,
∂12-Mar-87 0955 PAPA@score.stanford.edu Natarajan
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Mar 87 09:55:31 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 12 Mar 87 09:52:50 PST
Date: Thu 12 Mar 87 09:32:18-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Natarajan
To: fndsch@navajo.stanford.edu
Message-Id: <12285832269.29.PAPA@Score.Stanford.EDU>
Here is the schedule of his visit TODAY:
Schedule of Balas Natarajan. March 12, 1987.
10:00-10:30 Papadimitriou MJH 332.
10:30-11:00 Pratt MJH 428
11:00-11:30 Guibas MJH 330
11:30-12:30 Fast food with Papadimitriou
12:30- 1:30 Talk at MJH 352 (AFLB)
1:30- 2:00 FREE
2:00- 2:30 Knuth MJH 328
2:30- 3:00 Mayr MJH 334
3:00- 4:00 Graduate students, MJH 352
4:00- 4:30 FREE
4:30- 5:00 Jeff Ullman MJH 338
5:45 Dinner with Knuth, Papadimitriou, Ullman.
---Christos.
-------
∂12-Mar-87 1123 ladyb@ratliff.cs.utexas.edu Fall Appointment (from J. C. Browne)
Received: from SALLY.UTEXAS.EDU by SAIL.STANFORD.EDU with TCP; 12 Mar 87 11:21:21 PST
Received: by sally.utexas.edu (5.54/5.51)
id AA00564; Thu, 12 Mar 87 13:21:05 CST
Date: Thu, 12 Mar 87 13:19:14 CST
From: ladyb@ratliff.cs.utexas.edu (Sheila D. Bowman)
Posted-Date: Thu, 12 Mar 87 13:19:14 CST
Message-Id: <8703121919.AA17113@ratliff.cs.utexas.edu>
Received: by ratliff.cs.utexas.edu (5.54/5.51)
id AA17113; Thu, 12 Mar 87 13:19:14 CST
To: jmc@sail.stanford.edu
Subject: Fall Appointment (from J. C. Browne)
Cc: b.boyer, j.browne, ladyb@ratliff.cs.utexas.edu, w.bledsoe
TO: John McCarthy
FROM: J. C. Browne, Chairman
SUBJECT: Appointment for Fall 1987
DATE: March 11, 1987
This is a follow up to our telephone conversation of a week or so ago
about a visiting appointment for you in the Fall of 1987. The prospect of
your coming has aroused unanimous enthusiasm in the Department. I would
propose terms as follows:
1. A total salary of $60,000 for the Fall 1987 Semester. Although it is
not significant for your appointment, I will mention that $37,500 of
this $60,000 will come from State funds, and $22,500 from the earnings
of the B. R. Inman Chair.
2. We will be happy to pay your moving expenses to and from Stanford.
3. We will provide $7,500 in funds for support of research, travel, etc.
These funds, for example, could be used to support visits by your
colleagues and associates at Stanford with whom you may want to keep
in close contact.
4. We will also provide high-speed access to the R20 in your office, and
I believe also in your home. Please call or send email to discuss
modifications and/or extensions.
The Recruiting Committee is working on Dr. Talcott's vita, and will be
proposing terms and conditions to her in the near future.
We look forward with real enthusiasm to having you come to Austin.
JCB:sdb
∂12-Mar-87 1130 JMC
Gatterdam
∂12-Mar-87 1427 RA Your March 10th message to me
To: BS@SAIL.STANFORD.EDU
CC: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU
Betty,
I was puzzled by your message.
I ordinarily let people know in advance about my plans.
Unfortunately, on Tuesday as I said, my having to leave early was unexpected;
it had to do with a family matter which
required my immediate attention. I felt that I did all I could under
the circumstances by letting John, Zohar and LaDonna know that I am leaving,
and by putting my name on the board.
I realize that PTO requires prior approval, but the unexpected, by its very
nature, may preempt such a requirement.
I hope that in the future we'll be able to work more harmoniously to the
benefit of everyone concerned.
cc: Leah Kaplan, SU ombudsperson
∂12-Mar-87 1547 RA leaving
To: JMC@SAIL.STANFORD.EDU
CC: ZM@SAIL.STANFORD.EDU, eppley@SCORE.STANFORD.EDU
A reminder that it's Thursday and I'll be leaving at 4:00.
∂12-Mar-87 1644 LES Formal Reasoning Final Report
To: JMC, RPG, VAL, CLT
CC: RA
Given that the old DARPA contract on formal reasoning has just ended,
we owe them a final report. I propose to gather a list of reports and
external publications that were supported by this contract and, where
possible, get a copy of each and send them with a cover letter saying
"Here!"
I guess that I will have to buy another copy of RPG's overpriced book as
part of this. I would appreciate getting pointers from everyone by next
Wednesday (3/18).
Les
∂12-Mar-87 1811 guibas@decwrl.dec.com meeting tomorrow (3/13), at 4:30 pm, mjh 301
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 12 Mar 87 18:11:48 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Thu, 12 Mar 87 18:10:19 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA19749; Thu, 12 Mar 87 18:12:14 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA15613; Thu, 12 Mar 87 18:12:03 PST
Date: Thu, 12 Mar 87 18:12:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8703130212.AA15613@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: meeting tomorrow (3/13), at 4:30 pm, mjh 301
please think about your preferences beforehand. the spectrum of candidates
we have seen is pretty wide. we can also discuss schieber as a possible
postdoc.
l.
∂12-Mar-87 2212 RPG You CheapSkate
To: LES
CC: JMC, CLT
Earnest, you cheapskate, I'll bring one over as a gift to Stanford for
the final report. How do you expect authors to live on royalties with people
like you around?
-rpg-
∂13-Mar-87 0030 OKUNO@SUMEX-AIM.STANFORD.EDU Re: Futures
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 00:30:28 PST
Date: Fri 13 Mar 87 00:30:44-PST
From: Hiroshi "Gitchang" Okuno <Okuno@SUMEX-AIM.STANFORD.EDU>
Subject: Re: Futures
To: JSW@SAIL.STANFORD.EDU
cc: Qlisp@SAIL.STANFORD.EDU
In-Reply-To: Message from "Joe Weening <JSW@SAIL.STANFORD.EDU>" of Sat 7 Mar 87 13:50:00-PST
Message-ID: <12285995825.41.OKUNO@SUMEX-AIM.STANFORD.EDU>
In Qlisp/TAO, more precisely, Qlet/TAO implemented by Nob, futures are
implemented by mail-box and all qlet variables are converted to
peek-mail-box (TAO equivalent to potentia-future) form by macro
expansion. In this implementation, no futures cannot be carried out
from a qlet form. Our assumption is that constructor should create a
data structure which does not contain any futures. This assumption
excludes Joe's drawback (b) in 1. In other words, no-sublist-futures
or no-sub-...-sublist-futures form is not needed. Codewalk routine
will be useful to rewrite codes.
I prefer writing new functions by using qlisp primitives which is
proposed as 2 by Joe. Since CommonLisp supports packages, there will
be no name conflict. The followings are sample codes:
In qlisp package:
(defmacro car (x) `(common:car (potential-future ,x)))
(defmacro cdr (x) `(common:cdr (potential-future ,x)))
(defmacro eql (x y)
`(common:eql (potential-future ,x) (potential-future ,y)) )
(defun assoc (x y)
(cond ((null y) nil)
((eql x (car (car y))) (common:car y))
(t (assoc x (cdr y))) ))
- Gitchang -
-------
∂13-Mar-87 0901 JMC
qlisp
∂13-Mar-87 0901 GUNNING@Sushi.Stanford.EDU Take Home final and unintended typos
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 09:01:05 PST
Date: Fri 13 Mar 87 08:59:12-PST
From: David R. Gunning <GUNNING@Sushi.Stanford.EDU>
Subject: Take Home final and unintended typos
To: jmc@Sail.Stanford.EDU
Message-ID: <12286088387.18.GUNNING@Sushi.Stanford.EDU>
Prof Mccarthy,
I believe there is a typo in problem 1 of the take home exam. The axioms
include both NEXTTO(ROOM1,ROOM3) and NOT NEXTTO(ROOM1,ROOM3). I suspect that
the first one should refer to ROOM2 instead of ROOM1, but wanted to make sure.
David Gunning
-------
∂13-Mar-87 0917 coraki!pratt@sun.com Programming Languages
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 09:16:57 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Fri, 13 Mar 87 09:14:37 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA00156; Fri, 13 Mar 87 09:11:52 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA02824; Fri, 13 Mar 87 07:56:16 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA00687; Fri, 13 Mar 87 07:55:24 PST
Date: Fri, 13 Mar 87 07:55:24 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8703131555.AA00687@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Programming Languages
Cc: ac@score.stanford.edu
CMU provides outstanding coverage of programming and hardware
description languages. Their faculty include
Dana Scott Theory
Nico Habermann Software Systems
Ed Clarke Theory
John Reynolds Theory
Jim Morris Software Systems
Dan Siewiorek Hardware Systems
Dan Leivant Theory
Mary Shaw Software Systems
Steve Brookes Theory
Bill Scherlis Software Systems
Mario Barbacci Hardware Systems
Don Thomas Hardware Systems
The evaluation of the quality of any line-up is a pretty subjective
matter, but for me the above represents more than a ten-year lead over
Stanford, meaning that's the absolute minimum time we could hope to
bring our support of this area up to a comparable level even with an
all-out effort. Under our present approach to hiring in this area I'd
stretch this to around twenty years, namely the time to retirement for
most of the above.
I consider the level of enthusiasm at Stanford for hiring in this area
to be out of all reasonable proportion to both its intellectual and
economic importance.
-v
∂13-Mar-87 1051 DEWERK@Score.Stanford.EDU Robert Smith
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 10:51:49 PST
Date: Fri 13 Mar 87 10:40:24-PST
From: Gerda de Werk <DEWERK@Score.Stanford.EDU>
Subject: Robert Smith
To: jmc@Sail.Stanford.EDU
cc: stager@Score.Stanford.EDU
Message-ID: <12286106810.15.DEWERK@Score.Stanford.EDU>
John,
I have been trying to get a resume and some other information from him
since early February, without any luck. I cannot set-up his Lecturer
appointment or pay him if he doesn't cooperate. The other problem is
that he has still not let us know which textbook(s) he needs for his
course, and there isn't any way we can get those in time for Spring
Quarter.
Both Claire Stager and I have left numerous messages for him, and I
have sent him two memos. He has failed to respond.
Can you help with this?
Thanks,
Gerda
-------
∂13-Mar-87 1111 RA leaving shortly
To: eppley@SCORE.STANFORD.EDU, BS@SAIL.STANFORD.EDU,
JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU
I will be leaving shortly for my 11:30 medical appointment; will be back
at 1:30.
Rutie
-----
∂13-Mar-87 1205 cheriton@pescadero.stanford.edu Re: Programming Languages
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 12:04:18 PST
Received: from Pescadero.Stanford.EDU by navajo.stanford.edu with TCP; Fri, 13 Mar 87 12:02:36 PST
Received: by pescadero.stanford.edu with Sendmail; Fri, 13 Mar 87 11:58:42 pst
Date: Fri, 13 Mar 87 11:58:42 pst
From: David Cheriton <cheriton@pescadero.stanford.edu>
Subject: Re: Programming Languages
To: coraki!pratt@sun.com, fndsch@navajo.stanford.edu
Cc: ac@score.stanford.edu
CMU seems to be very strongly taking the "bigger is better" approach to
research. It is not clear to me that that is the route to the best quality
activity in the area. I am also not clear on what you mean by "our support
of this area". Does that mean support of teaching, student advising or
research activity?
I thought we have advertised fairly broadly and were trying hard to fill
the slots we have. What's the problem?
Also, is there anyone on the CMU list that you think we should hire, if we
could?
∂13-Mar-87 1329 JUTTA@Score.Stanford.EDU MS Admissions folders
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 13:27:07 PST
Date: Fri 13 Mar 87 13:25:12-PST
From: Jutta McCormick <JUTTA@Score.Stanford.EDU>
Subject: MS Admissions folders
To: jmc@Sail.Stanford.EDU
Stanford-Phone: (415) 723-0572
Message-ID: <12286136813.22.JUTTA@Score.Stanford.EDU>
Please return the set of MS admissions folders I sent you a few weeks ago
so I can ask another committee member to evaluate them.
--Jutta McCormick
------------
-------
∂13-Mar-87 1336 RA Time off
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU, BS@SAIL.STANFORD.EDU,
eppley@SCORE.STANFORD.EDU
I was notified by Columbia University that I am on their short list for
a lectureship position for the coming academic year, and was asked to fly
in for an interview April 16.
I would therefore like to take three working days off April 15-17.
Rutie
-----
∂13-Mar-87 1343 ZM workshop
John,
As you know, I am organizing, jointly with M. Sato, the US-Japan workshop
on "Logic of Programs", to be held at the East-West Center (Honolulu,
Hawaii) on May 18-21, 1987.
The workshop is sponsored jointly by the NSF (US) and the JSPS (Japan).
The NSF grant enables us to invite 12 researchers from the US. I would
like to ask you for additional support of $10K from the AAAI budget.
This will enable us to invite an additional 8-9 researchers.
Zohar
∂13-Mar-87 1502 AI.CHRISSIE@R20.UTEXAS.EDU Immune System Article
Received: from R20.UTEXAS.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 15:02:22 PST
Date: Fri 13 Mar 87 17:03:23-CST
From: AI.CHRISSIE@R20.UTEXAS.EDU
Subject: Immune System Article
To: jmc@SAIL.STANFORD.EDU
Message-ID: <12286154686.61.AI.CHRISSIE@R20.UTEXAS.EDU>
National Geographic has had an article in the past year (maybe year and
a half) on the immune system, AIDS, T,B-cells, etc. I found the article
well written and very clear. I believe the immune system article was
the "cover story".
Chrissie Sawyer
-------
∂13-Mar-87 1522 BSCOTT@Score.Stanford.EDU Re: Your March 10th message to me
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 15:21:57 PST
Date: Fri 13 Mar 87 15:19:12-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: Re: Your March 10th message to me
To: RA@Sail.Stanford.EDU, BS@Sail.Stanford.EDU
cc: JMC@Sail.Stanford.EDU, ZM@Sail.Stanford.EDU, eppley@Score.Stanford.EDU,
BSCOTT@Score.Stanford.EDU
In-Reply-To: Message from "Rutie Adler <RA@SAIL.STANFORD.EDU>" of Thu 12 Mar 87 14:27:00-PST
Message-ID: <12286157565.17.BSCOTT@Score.Stanford.EDU>
Perhaps the problem is one of semantics.
In any event, I don't anticipate further work attendance problems as long as
you understand and accept the fact that you are subject to the same policies
and procedures as is every CS staff member.
Betty
-------
∂13-Mar-87 2048 BRINK@Sushi.Stanford.EDU Job offer
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 20:48:36 PST
Date: Fri 13 Mar 87 20:46:52-PST
From: Ed Brink <brink@Sushi.Stanford.EDU>
Subject: Job offer
To: jmc@Sail.Stanford.EDU
Message-ID: <12286217213.17.BRINK@Sushi.Stanford.EDU>
...should you choose to accept it:
Would you consent to be my advisor? I would rather get advice from someone a
bit closer to the area I am trying to study than is Prof. Oliger. Not that I
take much advice anyhow. But when I try things like 306, 326 and 356 instead
of things like 212 and 242, I would like to think they are going to be helpful,
and an advisor who might say as much would be nice.
Jutta said she would just switch me over, but I guess I am old fashioned enough
to think it better to ask.
(Of course I know that things like 212 and 242 are sometimes necessary, like
vegetables. I just prefer to work out something that leads somewhere.)
..Ed
-------
∂13-Mar-87 2055 BRINK@Sushi.Stanford.EDU re: Job offer
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 13 Mar 87 20:55:34 PST
Date: Fri 13 Mar 87 20:53:49-PST
From: Ed Brink <brink@Sushi.Stanford.EDU>
Subject: re: Job offer
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 20:53:00-PST
Message-ID: <12286218481.17.BRINK@Sushi.Stanford.EDU>
Done.
-------
∂14-Mar-87 1021 CLT
boris is on KKHI at 10:30 this morning
∂14-Mar-87 1025 SINGH@Sierra.Stanford.EDU re: Law *requiring* firearms!
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Mar 87 10:24:58 PST
Date: Sat 14 Mar 87 10:25:55-PST
From: Harinder Singh <SINGH@Sierra.Stanford.EDU>
Subject: re: Law *requiring* firearms!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 20:14:00-PST
Message-ID: <12286366319.9.SINGH@Sierra.Stanford.EDU>
Prof. McCarthy,
Thank you for your response. Sure appreciate the info !
Best regards,
Inder
-------
∂14-Mar-87 1259 guibas@decwrl.dec.com summary of meeting, 3/13
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Mar 87 12:58:55 PST
Received: from sonora.dec.com (sonora-stanford.dec.com) by navajo.stanford.edu with TCP; Sat, 14 Mar 87 12:57:03 PST
Received: from src.dec.com by sonora.dec.com (5.54.3/4.7.34)
id AA11986; Sat, 14 Mar 87 12:58:45 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA05313; Sat, 14 Mar 87 12:58:03 PST
Date: Sat, 14 Mar 87 12:58:03 PST
From: guibas@decwrl.dec.com (Leonidas Guibas)
Message-Id: <8703142058.AA05313@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@decwrl.dec.com
Subject: summary of meeting, 3/13
we will tell no to cole and natarajan. we will tell friedman that the
committee plans to recommend to the full faculty that we make him an offer.
we have ordered the rest of those interviewed as follows:
mitchell
<sleator>
goldberg
suri
out intent is to make offers to as many of them as we can, in this order.
sleator is in brackets because it may be more appropriate to consider him
for a tenured appointment next year.
action items:
ernst: please notify friedman and cole
christos: please notify natarajan
don: let us know how the discussion with gibbons on slots goes
i'll be out of town till 3/30. in my absence, i hope that christos can take
care of any immediate needs that may arise.
remember that our recommendations to the full faculty will be made on
tuesday, april 7.
l.
∂14-Mar-87 1831 TEICH@Sushi.Stanford.EDU Spring financing
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 14 Mar 87 18:30:59 PST
Date: Sat 14 Mar 87 18:29:04-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: Spring financing
To: jmc@Sail.Stanford.EDU
Message-ID: <12286454274.26.TEICH@Sushi.Stanford.EDU>
During the fall quarter, you told me that if I couldn't get a TA or RA
position for spring qtr I should check with you. You said you might know
some companies that could hire someone. Stuart told me the chances of
my getting a TA position are close to zero, and I've been told the same
about work-study RA positions.
I have a BBA in Business Analysis (Management Information Systems). I am
interested in business applications of AI. Though that is my primary choice
for a field to work in, I basically need to find a job that will help pay
for school. I already have a large amount of student loans, and don't want
to go any further in debt.
I can give you a resume or any other information you might need.
david
-------
∂15-Mar-87 0026 RLG 326 final
a question on the final:
problem 5 (Chron. Min.):
how are 2 situations related in time if they are not related
by result, even indirectly? i.e. if they are in different situation
histories? it seems i should just leave this unspecified.
but then, which ab is "smaller" under < if ab1 is true
earlier in situation history 1 and ab2 is true earlier
in situation history 2?
perhaps these two ab's are not related by <. is < total?
must ab1 be < ab2 on all situation histories to be < ?
is the intended < anti-symmetric? just what is the intended < ?
will i find help in Shoam's work? he seems to use a total time relation.
this problem comes up because "earliest situation where ab is true"
is not well defined in a partial order.
a related question: should the ab which is never true be the
least in our ordering or the greatest? i guess least by thinking
of our goal.
maybe i just need to think about it more, but i thought i'd check.
thanx,
∂15-Mar-87 1328 RLG re: final
yes, i understand this, but it leaves all my questions unanswered.
what i don't understand is how to relate ab1 and ab2 when
there is no clear definition of "earliest situation where ab is true"
(because "earlier" is a partial order).
∂15-Mar-87 1420 RLG typo? on final
problem 1 has what appears to me to be a serious typo:
the third axiom contains a contradiction:
nextto(Room1,Room3) and ¬nextto(Room1,Room3)
undoubtedly, one of the two 1's was intended to be a 2.
which question shall i answer?
it IS too bad we don't have a class e-mail list.
∂15-Mar-87 1835 TEICH@Sushi.Stanford.EDU re: Spring financing
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 15 Mar 87 18:35:44 PST
Date: Sun 15 Mar 87 18:33:52-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: re: Spring financing
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 14 Mar 87 18:40:00-PST
Message-ID: <12286717291.8.TEICH@Sushi.Stanford.EDU>
Thank you...
david
-------
∂16-Mar-87 0727 RPG X3J13
You should be in Meeting Room C (I think) at Rickey's Hyatt
at 1pm today. Today's sessions are most appropriate for you
to attend.
-rpg-
∂16-Mar-87 0755 BSCOTT@Score.Stanford.EDU re: Performance Evaluations
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 07:55:02 PST
Date: Mon 16 Mar 87 07:53:16-PST
From: Betty Scott <BSCOTT@Score.Stanford.EDU>
Subject: re: Performance Evaluations
To: JMC@Sail.Stanford.EDU
cc: BSCOTT@Score.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 17:36:00-PST
Message-ID: <12286862816.12.BSCOTT@Score.Stanford.EDU>
John, I thought that LaDonna had given you the evaluation form for Rutie--
I'll check with her. We need reviews on research associates also, and I'll
talk to Les about this.
Betty
-------
∂16-Mar-87 0844 AI.BOYER@MCC.COM hi
Received: from MCC.COM by SAIL.STANFORD.EDU with TCP; 16 Mar 87 08:44:29 PST
Date: Mon, 16 Mar 1987 10:43 CST
Message-ID: <AI.BOYER.12286871966.BABYL@MCC.COM>
From: AI.BOYER@MCC.COM
To: jmc@su-ai
Subject: hi
I am extremely glad that you are visiting at UT. Please let
me know if I can be of assistance. I hope you realize that
you are regarded with the very highest esteem down here and
if you don't like something about your arrangements you
should say so and it can probably be fixed.
I am hoping to dig into research on common sense reasoning
and will definitely be attending your course if you don't
mind. Please let me know when you know what time and days
your course will be offerred.
Classes ususally start right after Labor Day.
∂16-Mar-87 1000 JMC
nafeh re teich
∂16-Mar-87 1030 WIEDERHOLD@sumex-aim.stanford.edu Re: Programming Languages
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 10:30:10 PST
Received: from SUMEX-AIM.Stanford.EDU by navajo.stanford.edu with TCP; Mon, 16 Mar 87 10:27:39 PST
Date: Mon 16 Mar 87 10:27:06-PST
From: Gio Wiederhold <WIEDERHOLD@sumex-aim.stanford.edu>
Subject: Re: Programming Languages
To: cheriton@pescadero.stanford.edu
Cc: coraki!pratt@sun.com, fndsch@navajo.stanford.edu, ac@score.stanford.edu,
faculty@score.stanford.edu
In-Reply-To: Message from "David Cheriton <cheriton@pescadero.stanford.edu>" of Fri 13 Mar 87 12:06:35-PST
Message-Id: <12286890821.68.WIEDERHOLD@SUMEX-AIM.STANFORD.EDU>
It appears to me that productivity at CMU is not quite in proportion with
faculty size. And since systems are changing rapidly, if we attack newly
relevant areas, we should be able to compare favorably more rapidly than
looking at the backlog would predict.
Gio
-------
∂16-Mar-87 1108 RA David Chudnovsky
David would like you to call him.
∂16-Mar-87 1202 RA David Chudnovsky
David called again a few minutes ago he wanted me to give you his number
(212) 864 5320.
∂16-Mar-87 1329 davism@nyu-csd1.arpa
Received: from NYU-CSD1.ARPA by SAIL.STANFORD.EDU with TCP; 16 Mar 87 13:29:14 PST
Date: Mon, 16 Mar 87 16:15:37 est
From: davism@nyu-csd1.arpa (Martin Davis)
Message-Id: <8703162115.AA14745@nyu-csd1.arpa>
Received: by nyu-csd1.arpa; Mon, 16 Mar 87 16:15:37 est
To: jmc@su-ai
Hi John! I'm writing a historical article (about relations between
logic & computing) and have been reading your paper on the history of
LISP in Wexelblat's "History of Programming Languages". In it you
write of certain early decisions being unfortunate because
"Beside encouraging pornographic programming, ... "
What is pornographic programming ?
-Martin
∂16-Mar-87 1337 SJG logic article
Hi John:
I'll be out of town from 3/25 to 4/15, and getting progressively more
panicked at the 25th approaches. If you want coherent comments, you
should get me the article as soon as is convenient.
Thanks --
Matt
∂16-Mar-87 1418 MAYR@Score.Stanford.EDU course on interactive proof checkers etc
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 14:17:02 PST
Date: Mon 16 Mar 87 14:15:06-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: course on interactive proof checkers etc
To: jmc@Sail.Stanford.EDU, shankar@Score.Stanford.EDU
Message-ID: <12286932327.20.MAYR@Score.Stanford.EDU>
The Office of the Dean in H&S is asking for a letter of support with regard
to the proposed course from John McCarthy and a letter from Natarajan
with a detailed budget and an account of sources of other funding.
Also, since this seems to be a proposal for a new course, the curriculum
committee and the undergraduate committee should get involved. At this
point, the curriculum committee has not yet received a proposal to consider
such a new course. In view of deadlines for C&D it is essential that we can
evaluate any such proposal in the very near future!
Please send the letters referred to above to me. I'll package the whole
thing and will then send it on to the Dean's Office. Thanks for your help,
-ernst
-------
∂16-Mar-87 1424 LES
∂16-Mar-87 1242 JMC
To: RA, LES, VAL
simpso.2[let,jmc] is a draft cover letter for the DARPA proposal.
LES - Protection is too high.
∂16-Mar-87 1459 TAJNAI@Score.Stanford.EDU please verify
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 14:59:19 PST
Date: Mon 16 Mar 87 14:57:29-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: please verify
To: jmC@Sail.Stanford.EDU
Message-ID: <12286940042.37.TAJNAI@Score.Stanford.EDU>
John, I have you down for the following societies/awards, plus your chair
ACM Turing
American Academy of Arts & Sciences
National Academy of Engineering
Are there other SPECIAL ones? I'm not going to include all the
honorary degrees of our faculty, but I do want to get the
very special awards.
Carolyn
-------
∂16-Mar-87 1730 TAJNAI@Score.Stanford.EDU re: please verify
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 17:30:50 PST
Date: Mon 16 Mar 87 17:23:51-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: re: please verify
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Mar 87 16:09:00-PST
Message-ID: <12286966688.37.TAJNAI@Score.Stanford.EDU>
You've got it, John. I'll include it.
Carolyn
-------
∂16-Mar-87 1807 PLAMBECK@Sushi.Stanford.EDU re: ``We present you now Professor Twist...''
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 18:07:24 PST
Date: Mon 16 Mar 87 18:05:28-PST
From: Thane E. Plambeck <PLAMBECK@Sushi.Stanford.EDU>
Subject: re: ``We present you now Professor Twist...''
To: JMC@Sail.Stanford.EDU
cc: plambeck@Sushi.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Mar 87 18:03:00-PST
Message-ID: <12286974266.33.PLAMBECK@Sushi.Stanford.EDU>
You're absolutely right, it is trustees. Titled ``The Purist,'' I think,
but I'm not sure, again.
-------
∂16-Mar-87 1820 MAYR@Score.Stanford.EDU re: course on interactive proof checkers etc
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 18:20:40 PST
Date: Mon 16 Mar 87 18:18:52-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: re: course on interactive proof checkers etc
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Mar 87 16:39:00-PST
Message-ID: <12286976705.16.MAYR@Score.Stanford.EDU>
Well, the Office of the Dean (of H&S) has a proposal addressing undergraduate
teaching in particular, by Shankar and you. If you are not interested in
getting any support from them I guess the whole thing could just as well fade
away. If not, I am perfectly happy to talk to you briefly tomorrow so that we
can find out where the whole matter stands, and what we want to do. Please
let me know which time is convenient (the closer to noon the better; I have
another appointment from 10 to 10:30; take your freedom to choose).
-ernst
-------
∂16-Mar-87 2000 SCHOLZ@Sushi.Stanford.EDU Re: expert on women's gymnastic
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 20:00:03 PST
Date: Mon 16 Mar 87 19:58:06-PST
From: Karin Scholz <SCHOLZ@Sushi.Stanford.EDU>
Subject: Re: expert on women's gymnastic
To: JMC@Sail.Stanford.EDU
cc: SCHOLZ@Sushi.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 21:49:00-PST
Message-ID: <12286994770.12.SCHOLZ@Sushi.Stanford.EDU>
john,
many gymnastics coaches are former gymnasts, but nadia's former coach,
bela carolli, is not, so he would be a good example for you to use.
he is large. i don't know if i would call him fat. he is currently
coaching in houston. i called his gym, but they don't have any
publicity photos of him to send out. magazines like 'international
gymnast' have photos of him coaching almost every month, however,
so you could check the magazine shops for a photo. 'sports illustrated'
certainly had photos of him during the olympics coverage this past
olympics. (he was mary lou retton's coach, too.) i'll check the
-------
∂16-Mar-87 2002 SCHOLZ@Sushi.Stanford.EDU Re: expert on women's gymnastic
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 20:01:56 PST
Date: Mon 16 Mar 87 20:00:01-PST
From: Karin Scholz <SCHOLZ@Sushi.Stanford.EDU>
Subject: Re: expert on women's gymnastic
To: JMC@Sail.Stanford.EDU
cc: SCHOLZ@Sushi.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 21:49:00-PST
Message-ID: <12286995118.12.SCHOLZ@Sushi.Stanford.EDU>
continued...
i'll check the mag shop on emerson to see if they carry 'international
gymnast.'
good luck,
karin
-------
∂17-Mar-87 0002 JACOBS@Sushi.Stanford.EDU re: Law *requiring* firearms!
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 00:02:51 PST
Date: Tue 17 Mar 87 00:00:46-PST
From: Joseph D. Jacobs <JACOBS@Sushi.Stanford.EDU>
Subject: re: Law *requiring* firearms!
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 13 Mar 87 20:14:00-PST
Message-ID: <12287038945.10.JACOBS@Sushi.Stanford.EDU>
Thanks for the clarification. My first inclination while
posting my message was that firearms had been banned, but I thought
that that was so ridiculous that it couldn't have been the case. My
memory wasn't firm enough about it so I was able to sort of convince
myself that it was only a registration law. The distinction between
handguns and other firearms makes it more believable.
Joseph
-------
∂17-Mar-87 0126 SHIH@Sushi.Stanford.EDU re: Poverty In America
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 01:26:00 PST
Date: Tue 17 Mar 87 01:24:04-PST
From: Frank Shih <SHIH@Sushi.Stanford.EDU>
Subject: re: Poverty In America
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 11 Mar 87 18:31:00-PST
Message-ID: <12287054110.37.SHIH@Sushi.Stanford.EDU>
Some 200 messages ago JMC wrote:
"Now we spend even more on various kinds of welfare than on defense, and
yet the poverty problem is said to be worse than it was then."
Would JMC support this contention with some statistics? My recollection is
that the Defense budget can fairly be characterized as having tripled, from
100 billion in 1980 to 300 billion (give or take a few billion)
whereas no other part of the budget can be said to have increased
by such a margin.
To be fair, please use the same measure for both aspects of the budget
(i.e. constant dollars, plain dollars, percent of budget, etc.). I don't
consider percentage of GNP a fair measure, since, one would expect the
Defence budget to be used to defend *people*, not the GNP. Nor do I
consider it fair to claim DOD's budget increase is only 3% this year,
without stating that that is above inflation (unless you are willing to
state other aspects of the budget similarly).
-------
∂17-Mar-87 0909 BRINK@Sushi.Stanford.EDU Meeting
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 09:09:24 PST
Date: Tue 17 Mar 87 09:07:27-PST
From: Ed Brink <brink@Sushi.Stanford.EDU>
Subject: Meeting
To: jmc@Sail.Stanford.EDU
Message-ID: <12287138466.13.BRINK@Sushi.Stanford.EDU>
I assume we are still on for 1PM at your office. Presumably we will not take
long deciding whether you ought to be my advisor, but I have nothing after that
until about 2:30 or 2:45.
I'll check back here before I come over.
..Ed
-------
∂17-Mar-87 0938 JJW AAP meeting 3/18/87 9:00am N.Osato
To: Qlisp@SAIL.STANFORD.EDU
This talk may be of interest to Qlispers. Apologies to those who are
receiving this message twice.
∂16-Mar-87 1733 SARAIYA@SUMEX-AIM.STANFORD.EDU AAP meeting 3/18/87 9:00am N.Osato
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 16 Mar 87 17:33:27 PST
Date: Mon 16 Mar 87 17:31:58-PST
From: Nakul P. Saraiya <SARAIYA@SUMEX-AIM.STANFORD.EDU>
Subject: AAP meeting 3/18/87 9:00am N.Osato
To: aap@SUMEX-AIM.STANFORD.EDU
Message-ID: <12286968167.82.SARAIYA@SUMEX-AIM.STANFORD.EDU>
Nob Osato, visiting from NTT, will talk to the AAP.
*** Porting CARE to TAO and other topic ***
I'll report my 6 month work at KSL. It includes:
1. Porting CARE to TAO
This will be the main topic. I'll touch on the TAO/ELIS system and
show how we (Gitchang and I) ported CARE to TAO in detail (including
some coding techniques). TAO is an interpreter-centered Lisp dialect
whose (native) language spec strongly reflects the hardware features
of the ELIS machine. On the other hand, Symbolics/TI-Explorer, on
which the original CARE runs, are compiler-based systems. Therefore,
I'll go into some differences between them from the viewpoints of
efficiency and programming technique. During our work, we found some
seem-to-be-inefficient codes in the original CARE. I'll point them
out. We also found some problems in TAO during this porting. I'll
show you some of them and give a prospect for the improvement.
2. Experimental implementation of QLET of QLISP in TAO
TAO is a multi-user, multi-process system. We exprimentally
implemented QLET of QLISP using the TAO's multi-process feature. It
showed a possibility in which TAO might be used as an experimental
tool for parallel language design and implementation. I'll give a
brief description of the QLET implementaion in TAO.
-------
∂17-Mar-87 0944 CLT kyoto
I received a reply from Hagiya saying that he
can see us any day but monday the 30th.
Also he suggested we might visit with one of his KCL collaborators
Dr. Yuasa. I would like to suggest meet with them Tuesday.
I assume one could take a late afternoon or early evening train to
Tokyo.
∂17-Mar-87 1001 SCHOLZ@Sushi.Stanford.EDU re: expert on women's gymnastic
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 10:00:49 PST
Date: Tue 17 Mar 87 09:58:49-PST
From: Karin Scholz <SCHOLZ@Sushi.Stanford.EDU>
Subject: re: expert on women's gymnastic
To: JMC@Sail.Stanford.EDU
cc: SCHOLZ@Sushi.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Mar 87 21:28:00-PST
Message-ID: <12287147817.28.SCHOLZ@Sushi.Stanford.EDU>
Mac's on Emerson doesn't carry 'International Gymnast.' Printer's Inc
might.
Good luck,
karin
-------
∂17-Mar-87 1037 CLT This week's Qlisp meeting
To: QLISP@SAIL.STANFORD.EDU
Time: Friday Mar 20, 11:00
Place: 252 Margaret Jacks
Topics:
Nob Osata will tell us about QLET in TAO.
Simulation experiments - bignums and subst.
∂17-Mar-87 1037 BARWISE@CSLI.Stanford.EDU Undergrad course on interactive proofs
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 10:36:35 PST
Date: Tue 17 Mar 87 10:30:30-PST
From: Jon Barwise <BARWISE@CSLI.Stanford.EDU>
Subject: Undergrad course on interactive proofs
To: Shankar@Score.Stanford.EDU
cc: REges@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Message-ID: <12287153584.25.BARWISE@CSLI.Stanford.EDU>
Natarajan,
Stuart Reges sent me a copy of a memo about your propsed undergrad
course. It seems to me that it could be of great interest to symbolic
systems majors. I wonder how I, as director of SSP, might be able to
help make sure it happens. Maybe a memo of support from me, or our
committee, of support, might help. Could you send a descprition of
the course to SSP-committee@csli, together with any suggestions about
how we might help? What is needed? -Jon
-------
∂17-Mar-87 1224 RA leak in your house
Bill Lipp, the guy who is working on the leak, called. He fixed the leak
and would like to come to test it tomorrow. Please call him at your house
or at his office 327 1943.
∂17-Mar-87 1332 REGES@Score.Stanford.EDU interactive proof-checkers
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 13:32:33 PST
Date: Tue 17 Mar 87 13:30:47-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: interactive proof-checkers
To: shankar@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12287186404.12.REGES@Score.Stanford.EDU>
Your proposal is very interesting. Please call on me to help out in whatever
way I can. I have already mentioned it to Jon Barwise and I see that he has
also contacted you. I serve on the committees of all the undergrad programs
involving CS and I also serve on our curriculum and MS committees, so I can
help to funnel information in the right directions. I can also help to find
equipment if you need it. For example, we have some IBM RT's available to us.
There is a new model that is significantly faster than the one John was playing
with last year and I believe Lucid has a nice implementation of Common Lisp for
it.
Again, please call on me if I can advise or help out in any way.
-------
∂17-Mar-87 1333 @Score.Stanford.EDU:helen@Psych.Stanford.EDU re: slugs, trees, eyes and pelicans
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 13:33:14 PST
Received: from Psych.Stanford.EDU by SCORE.STANFORD.EDU with TCP; Tue 17 Mar 87 13:31:28-PST
Received: by Psych.Stanford.EDU; Tue, 17 Mar 87 13:24:03 PST
Date: Tue, 17 Mar 87 13:24:03 PST
From: Helen Cunningham <helen@Psych.Stanford.EDU>
Subject: re: slugs, trees, eyes and pelicans
To: jmc@score.stanford.edu
Cc: helen@Psych.Stanford.EDU
>That's not by Ogden Nash; it's by Dixon Lanier Merritt, of course.
Of course! By the way, who IS Dixon Lanier Merritt? And why does
he write so much like Ogden Nash, or vice versa?
-helen
∂17-Mar-87 1337 AIR reply to message
[In reply to message rcvd 16-Mar-87 17:20-PT.]
What should I do, beside being here?
∂17-Mar-87 1340 REGES@Score.Stanford.EDU addendum
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 17 Mar 87 13:40:30 PST
Date: Tue 17 Mar 87 13:38:42-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: addendum
To: shankar@Score.Stanford.EDU, jmc@Sail.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12287187844.12.REGES@Score.Stanford.EDU>
I forgot to mention that you might want to touch bases with Pat Suppes' group.
They teach a logic course totally by computer, Philosophy 57. Your proposal
addresses different areas than their research, but I think there is enough
common interest that it might be worth your while to talk to them. Suppes is
hard to reach, but I've had good luck working with Tryg Ager.
-------
∂17-Mar-87 1400 JMC
Bernstein 3-2676
∂17-Mar-87 1905 ME Lathrop spooling
I notice that you have an entry in the Lathrop spooler queue from yesterday.
Perhaps you forgot about it and just haven't turned on the printer.
∂18-Mar-87 0733 davism@nyu-csd1.arpa Re: reply to message
Received: from NYU-CSD1.ARPA by SAIL.STANFORD.EDU with TCP; 18 Mar 87 07:33:32 PST
Date: Wed, 18 Mar 87 10:17:03 est
From: davism@nyu-csd1.arpa (Martin Davis)
Message-Id: <8703181517.AA21970@nyu-csd1.arpa>
Received: by nyu-csd1.arpa; Wed, 18 Mar 87 10:17:03 est
To: JMC@SAIL.STANFORD.EDU
Subject: Re: reply to message
Thanks.
I use it by only marginally. I used it the other day when NYU's mailer
refused an address (it turned out because it was lacking a ".edu").
I sent the message successfully from SAIL and incidentally learned
what the trouble was.
I can hardly claim great need.
-Thanks, Martin
∂18-Mar-87 0813 JJW visit to California
To: JMC@SAIL.STANFORD.EDU, CLT@SAIL.STANFORD.EDU,
IGS@SAIL.STANFORD.EDU
∂18-Mar-87 0751 rhh%VX.LCS.MIT.EDU.#Chaos@XX.LCS.MIT.EDU visit to California
Received: from XX.LCS.MIT.EDU by SAIL.STANFORD.EDU with TCP; 18 Mar 87 07:51:09 PST
Received: from LIVE-OAK.LCS.MIT.EDU by XX.LCS.MIT.EDU via Chaosnet; 18 Mar 87 10:43-EST
Received: from ASPEN.LCS.MIT.EDU by MIT-LIVE-OAK.ARPA via INTERNET with SMTP id 33667; 18 Mar 87 10:46:32-EST
Date: Wed, 18 Mar 87 10:46 EST
From: Robert Halstead <rhh@VX.LCS.MIT.EDU>
Reply-To: rhh@MC.LCS.MIT.EDU
Subject: visit to California
To: jjw@SAIL.STANFORD.EDU, rpg@SAIL.STANFORD.EDU
cc: rhh@MC.LCS.MIT.EDU
Message-ID: <870318104613.3.RHH@ASPEN.LCS.MIT.EDU>
Joe and Dick:
I am planning a visit to California during the week of April 27. I'm
sending this message to you two guys because you are the
Stanford-affiliated people with whom I have had the most contact. I
would be interested in seeing the Multilisp and QLISP work that's going
on at Stanford and in general talking with people who are thinking about
parallel processing. I would also be happy to give a seminar about the
current status of my work on Multilisp.
The best days for me to visit would be Tuesday or Wednesday, April
28-29, if that would be convenient, but I could also try for Thursday or
Friday if that would be better. Monday is tentatively booked for
another engagement, although that too could change. Could one of you
either check around and see if one of those days might be good, or refer
me to another person whom I should get in touch with? Thank you!
-Bert Halstead
∂18-Mar-87 1142 VAL Commonsense and Nonmonotonic Reasoning Seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
CIRCUMSCRIPTIVE THEORIES
Vladimir Lifschitz
Thursday, March 19, 4pm
Bldg. 160, Room 161K
The use of circumscription for formalizing commonsense knowledge and
reasoning requires that a circumscription policy be selected for each
particular application: we should specify which predicates are
circumscribed, which predicates and functions are allowed to vary,
what priorities between the circumscribed predicates are established,
etc. The circumscription policy is usually described either informally
or using suitable metamathematical notation. In this talk a simple and
general formalism will be proposed which permits describing circumscription
policies by axioms, included in the knowledge base along with the axioms
describing the objects of reasoning.
∂18-Mar-87 1224 NSH meeting
To: JMC@SAIL.STANFORD.EDU
CC: mayr@SCORE.STANFORD.EDU
I'd prefer to have the meeting some time next week if that is
not too inconvenient. My girlfriend is visiting me till friday
and I want to take her on a camping trip. In the mean time I will
prepare a tentative schedule for the course and some examples of
work that will be performed using the interactive proof-checker.
Shankar
∂18-Mar-87 1235 MAYR@Score.Stanford.EDU shankar
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 18 Mar 87 12:35:12 PST
Date: Wed 18 Mar 87 12:33:15-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: shankar
To: jmc@Sail.Stanford.EDU
Message-ID: <12287438073.14.MAYR@Score.Stanford.EDU>
We could still talk about the course even if Shankar is not here. Of course,
if a new course for undergraduates is intended there is some time pressure
to get the things resolved, passed by various committees (!), and into the
catalogue, not to mention the funding from H&S.
-ernst
-------
∂18-Mar-87 1406 VAL reply to message
[In reply to message rcvd 16-Mar-87 12:42-PT.]
Can you unprotect simpso.2[let,jmc]?
∂18-Mar-87 1504 SJG Symbolic support
Hi John:
Do you want to join in on the maintenance deal that KSL/Logic are
arranging with Symbolics? Should I be talking to Les about this?
Matt
∂18-Mar-87 1505 SJG logic paper
John:
Here are my comments. I hope they are what you want.
page 3, near the bottom. You mention ART and KEE without mentioning
a Teknowledge tool.
p.3-4 I like the hierarchy, but it seems to me that the distinction between
3 and 4 is wrong. There are those (e.g., Genesereth) who believe that
normal logic, unextended, is sufficient to describe general facts about
the world. Instead, I would describe the four categories as follows:
1. No inferential techniques needed.
2. Less-powerful-than-first-order inference.
3. First order inference.
4. More-powerful inference.
This seems a more uniform distinction.
Later on p.4, you might want to mention my readings collection in
non-monotonic inference. (Or might not.)
p.5, bottom. I believe that an introductory discussion of the foundations
of physics would be better off *without* formulae. (And perhaps the
same can be said of your paper.) Also, Steve Hanks appears to be a
co-inventor of the Yale shooting problem.
p.6. I'd like to see some stuff about why the unintended model is
still minimal. It isn't obvious that by unloading the gun, you avoid
having to violate the frame axiom about Fred staying alive. An informal
description would be best.
I think that the excerpt from VAL's paper will lose your entire
audience, and that you spend far too much time on this. I personally
doubt that this particular solution will stand the test of time, but
that is another matter.
p.7 middle. VAL's approach is hopeless as far as the ramification
problem goes, and he hasn't been able to come up with a fix -- so my
guess is that we already know that we *cannot* "write a large body of
common sense knowledge in the formalism ...".
p.7 bottom. I like the context stuff, but this single sentence seems
obscure as it stands.
p.8. 1: What about as a branch of mathematics?
I see no justification for it being one of the more difficult
sciences. Twistor theory was much harder.
4: what about a heuristic/expert system approach?
5: I think you've got the causal link reversed, here. The piecemeal
approach to philosophy of mind is causing our programs to have such
limited mental qualities. I don't think we have the expertise yet to
advise the philosophers.
7: The reference in the bibliography is to Kowalski (1985). (different
year).
I hope this helps. I apologize for not coming by in person -- I am going
crazy trying to finish everything I've got to get done before I go away
next week.
Matt
∂18-Mar-87 1545 CLT
∂18-Mar-87 1540 JMC
03-22 Monday, 9am, Steve Hamstad, 329-6929, Allstate Insurance Adjuster
3-22 is a sunday, i assume you mean next monday the 23rd
∂18-Mar-87 1748 SJG re: logic paper
[In reply to message rcvd 18-Mar-87 15:44-PT.]
Your message had no content (literally). I hope that this does not
mean you feel my message to be similar.
Matt
∂18-Mar-87 2024 JJW Halstead visit
To: JMC@SAIL.STANFORD.EDU, CLT@SAIL.STANFORD.EDU,
RPG@SAIL.STANFORD.EDU, IGS@SAIL.STANFORD.EDU
Bert Halstead has agreed to speak at the C.S. Colloquium on Tuesday April
28, so his visit here will probably be Tuesday and Wednesday, maybe
Thursday. We could set up individual times to talk with him or meet as a
group; whatever people want. His only time constraint other than the
colloquium seems to be meeting with people at SPAR, which he thinks may
take most of the day on either Tuesday or Wednesday.
∂19-Mar-87 0835 CLT
∂19-Mar-87 0653 hayashi%kurims.kurims.kyoto-u.junet%utokyo-relay.csnet@RELAY.CS.NET
Received: from RELAY.CS.NET by SAIL.STANFORD.EDU with TCP; 19 Mar 87 06:53:17 PST
Received: from relay2.cs.net by RELAY.CS.NET id ab28788; 19 Mar 87 9:49 EST
Received: from utokyo-relay by RELAY.CS.NET id ad15984; 19 Mar 87 9:45 EST
Received: by u-tokyo.junet (4.12/4.9J-1[JUNET-CSNET])
id AA02068; Thu, 19 Mar 87 23:39:20+0900
From: hayashi%kurims.kurims.kyoto-u.junet%utokyo-relay.csnet@RELAY.CS.NET
Received: by titcca.cc.titech.junet (4.12/6.2Junet)
id AA21396; Thu, 19 Mar 87 22:57:59 jst
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Thu, 19 Mar 87 17:25:26 jst
Received: by kuis.kuis.kyoto-u.junet (2.0/6.2Junet)
id AA29502; Thu, 19 Mar 87 17:16:02 jst
Received: by kurims.kurims.kyoto-u.junet (2.0/6.2Junet)
id AA01130; Thu, 19 Mar 87 17:12:23+0900
Date: Thu, 19 Mar 87 17:12:23+0900
Return-Path: <hayashi@kurims.kurims.kyoto-u.junet>
Message-Id: <8703190812.AA01130@kurims.kurims.kyoto-u.junet>
To: CLT@SAIL.STANFORD.EDU
Dear Dr. Talcott,
The office of international relation of RIMS has arranged
your visit to Syugaku-in Vila. The time is 10 AM on Tuesday.
It will take less than 10 minitues from RIMS to the vila
by car. I hope the schedule is good for you two.
The office of imperial house hold agancy which keeps the vila
needs the address and ages of two of you. I am sorry that
to ask a lady's age. But could you inform me them?
If you do not like to say your age, then you may fib.
(But please do not mention you as a teenager! They may check.
The vila is beautiful, but its officials are very rigorous. Hang them!)
I have not reached Prof. Takasu, yet. So I will wirte later again.
Yours,
Susumu
∂19-Mar-87 0927 RA My vacation
To: JMC@SAIL.STANFORD.EDU, ZM@SAIL.STANFORD.EDU, LES@SAIL.STANFORD.EDU,
CLT@SAIL.STANFORD.EDU, VAL@SAIL.STANFORD.EDU,
shanaker@SCORE.STANFORD.EDU, rivin@SCORE.STANFORD.EDU,
AIR@SAIL.STANFORD.EDU, JJW@SAIL.STANFORD.EDU
This is a reminder that I will be on vacation next week.
Rutie
-----
∂19-Mar-87 0958 MACMILK@Score.Stanford.EDU re: the newest mac millen...
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 09:58:30 PST
Date: Thu 19 Mar 87 09:56:23-PST
From: Katie MacMillen <MACMILK@Score.Stanford.EDU>
Subject: re: the newest mac millen...
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 19 Mar 87 09:49:00-PST
Message-ID: <12287671663.38.MACMILK@Score.Stanford.EDU>
...so i have just been informed by my southern officemate. she
didn't know the part about grant's performance and drunkeness,
but did comment that it is now a beautiful, still town. i hope
when i tell my sister this that she won't be disappointed to
hear of the battle - and that my nephew won't be disconcerted
when he's older. ah well, too late for the time being.
thanks, john.
-katie
-------
∂19-Mar-87 1028 TAJNAI@Score.Stanford.EDU research interests
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 10:28:01 PST
Date: Thu 19 Mar 87 10:26:09-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: research interests
To: jmc@Sail.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12287677081.25.TAJNAI@Score.Stanford.EDU>
John, Nils wants to expand the paragraph about your research interests
for the dept. brochure.
Professor McCarthy's research interests are mainly in artificial
intelligence, especially the formalization of common sense knowledge of
how to achieve goals. In the late 1970s he developed a method of
non-monotonic reasoning called circumscription and published
papers on it in 1980 and 1986. He also has a project to develop
a version of Lisp for parallel processors called Qlisp.
Nils' comments:
amplify.
He invented Lisp, MTC, timesharing, coined word AI, etc!!
do you want to mention past president of AAAI?
John, please give this priority.
Carolyn
-------
∂19-Mar-87 1040 RA be back
I am going to the post office; will be back in about 1/2 hr.
∂19-Mar-87 1420 VAL call from Mike Buckley
Mike Buckley wants:
(1) to have their participation described in the proposal as a separate
project and have our contract with them included in the budget,
(2) to meet with us tomorrow.
I promised to call him later today after I talk with you.
∂19-Mar-87 1441 COHN@Sushi.Stanford.EDU Re: Hershey's
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 14:41:00 PST
Date: Thu 19 Mar 87 14:11:22-PST
From: Evan Cohn <COHN@Sushi.Stanford.EDU>
Subject: Re: Hershey's
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 19 Mar 87 12:37:00-PST
Message-ID: <12287718079.24.COHN@Sushi.Stanford.EDU>
I think you are right in your belief that they have already taken into
account the possibility that each person will use more than 1 bill when
they arrived at their figure although the odds are made a bit better than
you suggested because of the two letters.
-------
∂19-Mar-87 1450 VAL the Lawrence workshop
I checked on the flights that would bring me back in the afternoon of the
first day of the workshop, and couldn't find anything reasonable. So I decided
I won't go.
∂19-Mar-87 1510 TAJNAI@Score.Stanford.EDU re: research interests
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 15:08:57 PST
Date: Thu 19 Mar 87 15:06:27-PST
From: Carolyn Tajnai <TAJNAI@Score.Stanford.EDU>
Subject: re: research interests
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Thu 19 Mar 87 11:44:00-PST
Message-ID: <12287728107.21.TAJNAI@Score.Stanford.EDU>
John, I understand that it is awkward to write self praise.
However, you can control what is written by being involved in
the writing. At least it will be accurate. You have given me
plenty of material.
I do appreciate it. Now you can stop blushing.
Carolyn
-------
∂19-Mar-87 1551 RA leaving
To: JMC, ZM
It is Thursday and I will be leaving shortly.
∂19-Mar-87 1648 MAYR@Score.Stanford.EDU ug course, interactive proof systems
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 16:48:36 PST
Date: Thu 19 Mar 87 16:46:44-PST
From: Ernst W. Mayr <MAYR@Score.Stanford.EDU>
Subject: ug course, interactive proof systems
To: jmc@Sail.Stanford.EDU, shankar@Score.Stanford.EDU
Message-ID: <12287746363.41.MAYR@Score.Stanford.EDU>
I talked to the Dean's office in H&S. The money actually comes from the
Provost, and they just ended up administering the funds.
Thus, they are the people to send enthusiastic letters of support.
-ernst
-------
∂19-Mar-87 1800 VAL Nonmonotonic seminar
To: "@CS.DIS[1,VAL]"@SAIL.STANFORD.EDU
There will be no meetings until April 23.
Vladimir
∂19-Mar-87 2257 edsel!bhopal!jonl@navajo.stanford.edu Your talk at X3J13 meeting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 19 Mar 87 22:57:14 PST
Received: by navajo.stanford.edu; Thu, 19 Mar 87 22:55:57 PST
Received: from bhopal.edsel.com by edsel.uucp (2.2/SMI-2.0)
id AA00954; Thu, 19 Mar 87 19:36:28 pst
Received: by bhopal.edsel.com (3.2/SMI-3.2)
id AA02750; Thu, 19 Mar 87 19:33:12 PST
Date: Thu, 19 Mar 87 19:33:12 PST
From: edsel!bhopal!jonl@navajo.stanford.edu (Jon L White)
Message-Id: <8703200333.AA02750@bhopal.edsel.com>
To: navajo!jmc%sail@navajo.stanford.edu
Cc: navajo!Maida%IBM.COM@navajo.stanford.edu, bhopal!jonl@navajo.stanford.edu
Subject: Your talk at X3J13 meeting
Someone suggested that your comments to the X3J13 committee the other
day could made into a reasonable technical article for the next issue
of Lisp Pointers. Would you have the time to put them into some
printable format? hopefully within the next couple of weeks?
-- JonL --
∂20-Mar-87 0616 coraki!pratt@sun.com Mitchell correspondence
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Mar 87 06:16:12 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Fri, 20 Mar 87 06:14:23 PST
Received: from sun.Sun.COM (192.9.2.3) by Sun.COM (3.2/SMI-3.2)
id AA03831; Fri, 20 Mar 87 06:12:03 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA05021; Fri, 20 Mar 87 06:16:04 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA14583; Fri, 20 Mar 87 06:15:12 PST
Date: Fri, 20 Mar 87 06:15:12 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8703201415.AA14583@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Mitchell correspondence
A propos of the following message, what should we be telling
candidates below Friedman prior to April 7?
-v
-------------- Forwarded Message
From: John Mitchell <sun!ucbvax!research!mrkos!jcm>
Date: Thu, 19 Mar 87 08:22:30 PST
To: pratt@navajo.stanford.edu
I enjoyed the trip last week, and sent off receipts from my
expenses today. I have a number of questions about benefits
and University policies (e.g., use of athletic facilities
for my wife) which I would like to ask in the event that an
offer makes sense to you. However, it might be simplest for
everyone involved to wait until we see whether this matters.
I assume that the search committe will discuss the merits
of all the candidates relatively soon, since I gathered
(perhaps incorrectly?) that most of the interviews are over.
Do you have any idea what your schedule might be? I couldn't
quite figure out what sort of person you were looking for,
so I have no real idea of whether I would fit the bill.
In the event that a job now doesn't seem right, I hope we
will be able to keep in touch. I enjoyed meeting other people
at Stanford and would like stay informed of the many interesting
things going on there.
John
------- End of Forwarded Message
∂20-Mar-87 0900 JMC
qlisp
∂20-Mar-87 0911 CBARSALOU@Score.Stanford.EDU Re: AIDS
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Mar 87 09:11:38 PST
Date: Fri 20 Mar 87 09:09:30-PST
From: Caroline Barsalou <CBARSALOU@Score.Stanford.EDU>
Subject: Re: AIDS
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Mon 16 Mar 87 10:48:00-PST
Message-ID: <12287925272.14.CBARSALOU@Score.Stanford.EDU>
Thanks a lot for this very informative and non-partisan message.
I do appreciate also your overture to international issues, or, at least
your concern about the international reactions and aspects of the AIDS
threat.
We can always learn by others, close to us as well as from different natio-
nalities and cultures.
I'd welcome further information on this topic.
Caroline
-------
∂20-Mar-87 1134 RA Telex for you
Dear Mr. McCarthy
We need to receive your paper (8 pages) for MARI 87 no later than March 26,
imperatively. Looking forward to reading you.
Best regards,
Isabel Chardonnet
-----
end of telex
∂20-Mar-87 1200 JMC
Buckley at 1
∂20-Mar-87 1349 RA short abstract
I need a short abstract for the nsf renewal for one of the forms which
has to be sent with the proposal.
∂20-Mar-87 1749 GQ.JAN@forsythe.stanford.edu Lindy problem accessing Forsythe
Received: from LINDY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 20 Mar 87 17:49:02 PST
Received: by lindy.STANFORD.EDU; Fri, 20 Mar 87 17:50:38 PST
Date: Tue, 17 Mar 87 15:27:53 PST
From: Tony Navarrete <GQ.JAN@forsythe.stanford.edu>
To: JMC@sail.stanford.edu
Subject: Lindy problem accessing Forsythe
John,
I tried to call you, but you were out. The problem, I am told, has
been fixed. I was not able to talk to the programmer in order to
find out exactly what was going on, but it is, apparently, fixed
now.
Good luck with Folio.
Tony Navarrete
723-1662
To: JMC@SAIL
∂21-Mar-87 1243 RLG PhD prog's
McDermott sends his regards, as does Winston.
I'm now in Pittsburgh being wined and dined.
I've been defending logic almost nonstop for three
days now. My first direct exposure to the non-stanford view.
No conclusions yet...but they ARE very different views. It's
unfortunate that i am expected to kno9w so much about which perspective
i will want to pursue before i begin. the last three days
prepare me to have an interesting conversation with you, i hope,
to better discern your responses to these people.
Jon Doyle was also interesting to talk to.
back in Stanford tomorrow.
∂21-Mar-87 1753 SIEGMAN@Sierra.Stanford.EDU John, its "publicly" rather than "publically",
Received: from SIERRA.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 21 Mar 87 17:53:22 PST
Date: Sat 21 Mar 87 17:55:23-PST
From: Tony Siegman <SIEGMAN@Sierra.Stanford.EDU>
Subject: John, its "publicly" rather than "publically",
To: jmc@Sail.Stanford.EDU
Message-ID: <12288283150.18.SIEGMAN@Sierra.Stanford.EDU>
...but I had to look it up to be sure.
-------
∂22-Mar-87 0948 perlis@yoohoo.cs.umd.edu papers
Received: from MIMSY.UMD.EDU by SAIL.STANFORD.EDU with TCP; 22 Mar 87 09:48:40 PST
Received: from by mimsy.umd.edu (5.54/4.7)
id AA25556; Sun, 22 Mar 87 12:07:41 EST
Received: by yoohoo.cs.umd.edu (1.1/3.14)
id AA18857; Sun, 22 Mar 87 12:09:48 EST
Date: Sun, 22 Mar 87 12:09:48 EST
From: perlis@yoohoo.cs.umd.edu
Return-Path: <perlis@yoohoo.cs.umd.edu>
Message-Id: <8703221709.AA18857@yoohoo.cs.umd.edu>
To: jmc@sail.stanford.edu
Subject: papers
Cc: perlis@mimsy.umd.edu
John, I have put in the mail to you several recent papers of mine.
Any comments you have would be greatly appreciated. One of them,
titled ``Circumscription as introspection,'' is based on an idea
I had mentioned to you some years back when I was visiting Stanford.
It deals with a reformulation of your schema, to draw conclusions about
whether something is *known* rather than whether it is *true*. It
looks promising to me, so far at least.
Best regards,
Don
∂22-Mar-87 1726 LES Random Inputs
The current director of MIT's Research Lab. of Electronics (Jonathan
Allen) will give a talk to the local MIT Alumni Association on May 7.
The abstract of his talk lists six accomplishments of RLE since its
founding in 1946: the laser, the maser, the cesium clock, computer
timesharing, the high-field tokamak, and the LISP programming language,
so I guess that you can claim 1/3 of their productivity.
I noticed the following posting on AIList last week. If this is Marvin
Minsky, I am puzzled -- is he now saying that all that perceptron funding
was a good idea?
Date: Fri, 13 Mar 1987 19:14 EST
From: MINSKY%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU
Subject: AIList Digest V5 #77
Subject: AFOSR Announcement
<The Air Force Office of Scientific Research (AFOSR) announces a
<new program of support for basic research on the computational
<aspects of neural networks.
This is nice to see. Nearly thirty years ago, some brave and
imaginative officers at the AFOSR stuck their necks out and funded
several individuals working on early connectionist and symbolic AI
ideas. Many observers considered them irresponsible, but it led to a
lot of stimulating discoveries. Now that the field has become
respectable, their foresight ought to be acknowledged.
------------------------------
∂23-Mar-87 0932 TALEEN@Score.Stanford.EDU this week
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Mar 87 09:32:21 PST
Date: Mon 23 Mar 87 09:30:26-PST
From: Taleen Marashian <TALEEN@Score.Stanford.EDU>
Subject: this week
To: jmc@Sail.Stanford.EDU
Message-ID: <12288715515.23.TALEEN@Score.Stanford.EDU>
Hi Professor McCarthy,
Rutie has asked me to assist you and Professor Manna this week since she
will not be here. This is fine with me, but with exception to two
days: Monday (today) and Thursday. The rest of the week (Tuesday, Wednesday,
and Friday) I will be in from 9:00 to 5:00 (8 hrs - 1 hr for lunch = 7 hrs).
I look forward to it. If there is any problem whatsoever, please don't
hesitate to let me know.
Taleen
-------
∂23-Mar-87 1113 GINN@Sushi.Stanford.EDU
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Mar 87 11:13:26 PST
Date: Mon 23 Mar 87 10:58:28-PST
From: Michael Ginn <GINN@Sushi.Stanford.EDU>
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sun 22 Mar 87 17:09:00-PST
Message-ID: <12288731541.23.GINN@Sushi.Stanford.EDU>
I know nothing about Jonathan Traugott at all.
Looking him up with PEDIT, I see he's a PhD student, but it doesn't
give any other information.
Sorry I can't help you more,
---Michael Ginn
-------
∂23-Mar-87 1427 KARTAM@Sushi.Stanford.EDU MSCS-petition proposed program
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Mar 87 14:27:00 PST
Date: Mon 23 Mar 87 14:25:01-PST
From: Nabil Kartam <KARTAM@Sushi.Stanford.EDU>
Subject: MSCS-petition proposed program
To: jmc@Sail.Stanford.EDU
Message-ID: <12288769141.28.KARTAM@Sushi.Stanford.EDU>
I would like to clarify some points in my petition. Could I see you for
5 min. today. I am in MJH right now and can come any minute.
Nabil Kartam
-------
∂23-Mar-87 1631 JJW Alliant Common Lisp
To: edsel!ejg@NAVAJO.STANFORD.EDU
CC: edsel!jk@NAVAJO.STANFORD.EDU, JMC@SAIL.STANFORD.EDU,
RPG@SAIL.STANFORD.EDU, Rivin@SCORE.STANFORD.EDU
Erik,
At Jussi's suggestion, I'm sending you this message to register some
dissatisfaction with the progress of the Common Lisp on the Alliant. For
quite some time now, it's been in a semi-broken state in which disk-save
works only once after loading everything into the kernel, and thereafter
can't be used.
About two weeks ago I was compiling EKL, and after defining a lot of
symbols the compiler would die in the SYSTEM:REHASH function. Ron told me
this was a related problem (i.e., it only happens in images that have gone
through one disk-save), and that it would be fixed when Harlan returned
from vacation. Harlan has been back for more than a week, and the problem
still exists. The version of Lisp currently available to us has not
changed since March 10, in fact.
∂23-Mar-87 1652 ILAN@Score.Stanford.EDU Computer Chess
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Mar 87 16:52:44 PST
Date: Mon 23 Mar 87 16:50:19-PST
From: Ilan Vardi <ILAN@Score.Stanford.EDU>
Subject: Computer Chess
To: "chess demos": ;
cc: jmc@Sail.Stanford.EDU, su-events@Score.Stanford.EDU
Message-ID: <12288795591.10.ILAN@Score.Stanford.EDU>
Hitech, the world's highest rated computer chess program is supposed
to give a chess exhibition on campus tomorrow. This is part of the
VLSI conference at Stanford. Unfortunately I have not yet been able to
find out where and when this is supposed to happen (I am scheduled to
play the machine)! If anyone has more information please contact me
(ilan@score). The demo was to be organized by:
Paul Losleben (losleben@glacier)
Anthony McCarthy (mccarthy@sierra)
Carl Ebeling (ebeling@vlsi.cs.washington.edu)
-Ilan Vardi
-------
∂23-Mar-87 1905 @SUMEX-AIM.STANFORD.EDU:GOTO@NTT-20 Your visit to NTT laboratories on April 2 (Thu)
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 23 Mar 87 19:05:15 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Mon 23 Mar 87 19:02:53-PST
Date: Tue 24 Mar 87 09:56:14
From: Shigeki Goto <Goto@NTT-20>
Subject: Your visit to NTT laboratories on April 2 (Thu)
To: jmc%sail.stanford.edu@SUMEX-AIM, clt%sail.stanford.edu@SUMEX-AIM
cc: masahiko%NTTLAB.NTT@NTT-20, nue@NTT-20, hibino@NTT-20, naohisa@NTT-20,
katsuno@NTT-20, goto@NTT-20
Message-ID: <12288796669.25.GOTO@NTT-20.NTT.JUNET>
John and Carolyn,
Masahiko told me that both of you can visit our NTT Laboratory on
April 2 (Thu). We are very glad to hear that. I would like to
propose the following:
10:30 or 11:00 Masahiko will visit your Hotel (Maru-no-uchi)
He will take you to our Laboratory
(It will take about 60 minutes from your Hotel to NTT Lab.)
around 12:00 Have lunch at NTT Laboratory
13:30 to 15:00 Carolyn's talk (one hour) and discussion (30 min.)
[I would be happy if Carolyn will give a talk.]
15:00 to 17:00 Demonstration, Latest TAO-LISP features and
"working VLSI chip"
around 17:30 Leave NTT Laboratory to have dinner at some
Japanese restaurant (Takeuchi san proposes TEMPURA.)
I would appreciate if Carolyn could send me the title (and hopefully
the abstract) of the talk for our seminar announcement.
I am looking forward to seeing you at NTT Laboratory.
-- Shigeki
sg@sail (Thank you for keeping my forwarding address!)
-------
∂24-Mar-87 0800 JMC
Amarel and Simpson
∂24-Mar-87 0905 AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU [MARY%UK.AC.UMIST.CCL%UK.AC.UMIST@ac.uk: AAAI funding for workshops]
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Mar 87 09:05:22 PST
Date: Tue 24 Mar 87 09:06:05-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.STANFORD.EDU>
Subject: [MARY%UK.AC.UMIST.CCL%UK.AC.UMIST@ac.uk: AAAI funding for workshops]
rest copied into worksh[1,jmc]
∂24-Mar-87 1117 ILAN@Score.Stanford.EDU Location of Computer Chess Demo
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 24 Mar 87 11:17:25 PST
Date: Tue 24 Mar 87 11:14:57-PST
From: Ilan Vardi <ILAN@Score.Stanford.EDU>
Subject: Location of Computer Chess Demo
To: "Computer Chess": ;
cc: su-events@Score.Stanford.EDU
Message-ID: <12288996684.42.ILAN@Score.Stanford.EDU>
This will take place in Oak East, 1:30 today. This is probably
on the second floor of Tressider.
-Ilan Vardi
-------
∂24-Mar-87 1424 VAL exams
Yes, I'd like to look at the exams again before we give them back. I'll do
that tomorrow.
∂25-Mar-87 0821 perlis@yoohoo.cs.umd.edu Re: How can a program mean?
Received: from MIMSY.UMD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 08:20:30 PST
Received: from by mimsy.umd.edu (5.54/4.7)
id AA23204; Wed, 25 Mar 87 11:17:31 EST
Received: from localhost.umd.edu by yoohoo.cs.umd.edu (1.1/3.14)
id AA20864; Wed, 25 Mar 87 11:19:52 EST
Return-Path: <perlis@yoohoo.cs.umd.edu>
Message-Id: <8703251619.AA20864@yoohoo.cs.umd.edu>
To: jmc@sail.stanford.edu
Cc: perlis@mimsy.umd.edu
Subject: Re: How can a program mean?
In-Reply-To: Your message of 24 Mar 87 2323 PST.
<8703251036.AA17073@mimsy.umd.edu>
Date: Wed, 25 Mar 87 11:19:50 -0500
From: Don Perlis <perlis@yoohoo.cs.umd.edu>
From: John McCarthy <JMC@SAIL.STANFORD.EDU>
Thanks for it and the other papers. I have only skimmed it and
am not very sympathetic, but I need to point out that you have
given the wrong reference to one of mine. I discuss ascribing
beliefs to thermostats in "Ascribing Mental Qualities to Machines"
not in "Programs with Common Sense". I can send you a copy if
you don't have one. The version distributed as a Stanford AI
memo was a garbled draft printed by mistake, but the version
published in Ringle's Philosophical Perspectives in Artificial
Intelligence is correct.
Yes, please, I would like a copy.
I chose the thermostat as one example of ascribing precisely because
it can also be understood physically and go on to discuss a more
complicated temperature control system that some people might only
be able to understand intentionally. In general I agree with
Dennett in these matters. It seems to me that the next step is to
give some good AI examples where it is necessary for a program to
ascribe meaning in order to do some task that doesn't itself involve
ascribing meaning.
I agree, I'll let you know if I get a good solid example. I am inclined to
think that something along the lines of coming to regard a former belief as
false or conceptually ill-formed might fill the bill, as in my "I thought it
was a bowl, but it's a cup" sketch in the paper. But it does need more work
in order to be convincing.
Thanks very much for your comments on this.
By the way, I am curious whether my "Circumscription as introspection"
paper made any impression: at the end of it I apply the ideas to your "Is
Reagan now sitting or standing?" problem.
----
Don Perlis (301) 454-7931
perlis@mimsy.umd.edu
seismo!mimsy!perlis
Computer Science Department
University of Maryland
College Park, MD 20742
∂25-Mar-87 1051 TALEEN@Score.Stanford.EDU confirmation of dr.'s appt.
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 10:50:59 PST
Date: Wed 25 Mar 87 10:48:53-PST
From: Taleen Marashian <TALEEN@Score.Stanford.EDU>
Subject: confirmation of dr.'s appt.
To: jmc@Sail.Stanford.EDU
Message-ID: <12289254084.15.TALEEN@Score.Stanford.EDU>
Prof. McCarthy,
Dr. Tearse's nurse called to confirm your 10:30 appointment on Thursday
(tomorrow). If there are any problems, call 321-4500.
Taleen
-------
∂25-Mar-87 1113 EMMA@CSLI.Stanford.EDU Invitation (CSLI)
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 11:13:42 PST
Date: Wed 25 Mar 87 11:04:16-PST
From: Emma Pease <Emma@CSLI.Stanford.EDU>
Subject: Invitation (CSLI)
To: "@<csli-lists>reception.dis"@CSLI.Stanford.EDU
Tel: (415) 723-3561
Message-ID: <12289256882.22.EMMA@CSLI.Stanford.EDU>
You are cordially invited to a reception with the Trustees, Program
Officers, and Site Visitors of the System Development Foundation.
April 2, 1987
5:00 until 6:30 PM
Xerox PARC
3333 Coyote Hill Road
Palo Alto
Escorts will be available in the upper level lobby to accompany you
to the reception area.
-------
∂25-Mar-87 1140 RLG NSF
i received the NSF fellowship i applied for, so my funding is all set
for the next three years...
∂25-Mar-87 1436 TEICH@Sushi.Stanford.EDU re: Spring financing
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 14:36:20 PST
Date: Wed 25 Mar 87 14:34:09-PST
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: re: Spring financing
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Sat 14 Mar 87 18:40:00-PST
Message-ID: <12289295092.10.TEICH@Sushi.Stanford.EDU>
Have you heard any reply from John Nafeh? So far, I have been unsuccessful
finding a TA or RA position. I also don't have a loan yet.
david
-------
∂25-Mar-87 1512 TALEEN@Score.Stanford.EDU please call John Cate
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 15:12:10 PST
Date: Wed 25 Mar 87 15:09:49-PST
From: Taleen Marashian <TALEEN@Score.Stanford.EDU>
Subject: please call John Cate
To: jmc@Sail.Stanford.EDU
Message-ID: <12289301583.20.TALEEN@Score.Stanford.EDU>
Prof. McCarthy,
John Cate would like you to return his call at 321-1225.
Taleen
-------
∂25-Mar-87 1702 TALEEN@Score.Stanford.EDU tomorrow
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 17:02:45 PST
Date: Wed 25 Mar 87 17:00:34-PST
From: Taleen Marashian <TALEEN@Score.Stanford.EDU>
Subject: tomorrow
To: JMC@Sail.Stanford.EDU
Message-ID: <12289321747.27.TALEEN@Score.Stanford.EDU>
Hi, I'd just like to remind you that I won't be in tomorrow. See you on
Friday. Have a good evening, Taleen
-------
∂25-Mar-87 2100 REGES@Score.Stanford.EDU Do we want RT's?
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 25 Mar 87 21:00:11 PST
Date: Wed 25 Mar 87 20:58:05-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: Do we want RT's?
To: "folks who give good advice": ;
cc: "folks who like to know what's up": ;
Office: CS-TAC 22, 723-9798
Message-ID: <12289364985.16.REGES@Score.Stanford.EDU>
A goof has been made and the umbrella IBM grant is overcommitted. They are
considering what to cut out to make up the difference. RT's seem to be going
like crazy. A suggestion has been made that the original plan for 25 RT's for
each of EE and CS should become a joint lab of 20 for both. The original plans
for LOTS to have a cluster to support graphics and for IRIS to have them in an
electronic classroom seem to have evaporated. Meanwhile James is having
difficulty porting software to the RT's, Portia seems wonderful, and we are all
wondering about the Mac II.
What should be our stragic plan for the RT's? Last year we discussed having
specialized CS labs for courses like operating systems and more generic use like
graphics in LOTS clusters. Now I'm beginning to wonder if 20 machines is enough
of a critical mass to justify supporting yet another workstation.
Even having a total of 20 is questionable. Pat Devaney wants me to tell her how
much we want them. She doesn't want to fight for the 20 if we are going to
scrap them for other machines later.
Pat meets with an IBM rep on Monday. If any of you are around and can give me
some advice before Monday, please do so. I'm leaning towards giving back the
RT's altogether and calling Apple or SUN or DEC to find out what they have to
sell cheap.
-------
∂26-Mar-87 0221 REGES@Score.Stanford.EDU re: Do we want RT's?
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 02:21:50 PST
Date: Thu 26 Mar 87 02:19:30-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: re: Do we want RT's?
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Wed 25 Mar 87 23:33:00-PST
Office: CS-TAC 22, 723-9798
Message-ID: <12289423498.12.REGES@Score.Stanford.EDU>
No, your RT is not a possible target for elimination. We're just deciding the
question of whether to ask for more.
-------
∂26-Mar-87 0743 SCHAFFER@sushi.stanford.edu What did Dean Gibbons say...
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 07:43:26 PST
Received: from Sushi.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 26 Mar 87 07:41:50 PST
Date: Thu 26 Mar 87 07:40:56-PST
From: Alejandro Schaffer <SCHAFFER@sushi.stanford.edu>
Subject: What did Dean Gibbons say...
To: fndsch@navajo.stanford.edu
Message-Id: <12289482012.8.SCHAFFER@Sushi.Stanford.EDU>
about the number and timing of offers we can make?
Alex Schaffer
-------
∂26-Mar-87 0824 RPG My SAIL Account
To: LES, JMC
Gentlemen:
Lynn Gotelli wrote me:
``Richard, If you can convince Les or John that other funds here
at Stanford should continue to pay for your <RPG@Sail> please
have one of them send me a message authorizing me to charge
your usage to a university budget account number. Thanks, Lynn''
If one of you feels thus convinced, could you please mail her such
a note?
∂26-Mar-87 0935 PAPA@score.stanford.edu Re: What did Dean Gibbons say...
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 09:35:12 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Thu, 26 Mar 87 09:33:31 PST
Date: Thu 26 Mar 87 09:28:49-PST
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Re: What did Dean Gibbons say...
To: SCHAFFER@sushi.stanford.edu
Cc: fndsch@navajo.stanford.edu
In-Reply-To: <12289482012.8.SCHAFFER@Sushi.Stanford.EDU>
Message-Id: <12289501651.32.PAPA@Score.Stanford.EDU>
I have no idea. But I heard that Joe will get an offer from Princeton, and
he would probably take it.
---Christos.
-------
∂26-Mar-87 1016 GARDNER@CSLI.Stanford.EDU An invitation
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 10:15:55 PST
Date: Thu 26 Mar 87 10:14:04-PST
From: Anne Gardner <GARDNER@CSLI.Stanford.EDU>
Subject: An invitation
To: jmc@Sail.Stanford.EDU
cc: gardner@CSLI.Stanford.EDU
Message-ID: <12289509888.31.GARDNER@CSLI.Stanford.EDU>
As you might already know, there is to be a conference on AI and law
in Boston on May 27-29. The conference chair is Carole Hafner
(Northeastern), and the program chair, Thorne McCarty (Rutgers). I've
been on the program committee and expect it to be by far the best
meeting on the subject so far. The current guess is for about 200
registrants.
The question is, would you be at all interested in speaking at the
banquet? It's on Thursday evening, May 28. Expenses and an honorarium
would be paid.
I do hope you'll think this is worth your time. The conference would
certainly be honored to have you.
I'll forward a copy of the program in a separate message.
Anne
-------
∂26-Mar-87 1018 GARDNER@CSLI.Stanford.EDU Conference program
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 10:18:26 PST
Date: Thu 26 Mar 87 10:16:34-PST
From: Anne Gardner <GARDNER@CSLI.Stanford.EDU>
Subject: Conference program
To: jmc@Sail.Stanford.EDU
Message-ID: <12289510343.31.GARDNER@CSLI.Stanford.EDU>
------------------------------
Date: Fri, 13 Mar 87 19:01:56 EST
From: hafner%corwin.ccs.northeastern.edu@RELAY.CS.NET
Subject: Conference - AI and Law (Program and Registration Info)
The First
International Conference on Artificial Intelligence and Law
May 27-29, 1987
Northeastern University, Boston, Massachusetts
Sponsored by: The Center for Law and Computer Science
Northeastern University
In Co-operation with ACM SIGART
Schedule of Activities:
Wednesday, May 27
8:30 a.m. - 12:30 p.m. - Tutorials
2:00 p.m. - 6:00 p.m. - Research Presentations (see list below)
7:00 p.m. - 10:00 p.m. - Welcoming Reception - NU Faculty Center
Thursday and Friday, May 28-29
8:30 a.m. - 6:00 p.m. - Research Presentations (continued)
Thursday evening, May 28 - 7:00 p.m. - Gala Banquet at the Colonnade Hotel
Tutorials:
A. "Introduction to Artificial Intelligence (For Lawyers)." Edwina L.
Rissland,
Associate Professor of Computer and Information Sciences, University of
Massachusetts at Amherst, and Lecturer in Law, Harvard Law School, will
present the fundamentals of AI from the perspective of a legal expert.
B. "Applying Artificial Intelligence to Law: Opportunities and Challenges."
Donald H. Berman, Richardson Professor of Law, and Carole D. Hafner,
Associate Professor of Computer Science, Northeastern University, will
survey the past accomplishments and current goals of research in AI and Law.
Panels:
"The Impact of Artificial Intelligence on the Legal System."
Moderated by Cary
G. deBessonet, Director of the Law and Artificial Intelligence Project,
Louisiana State Law Institute.
"Modeling the Legal Reasoning Process: Formal and Computational Approaches."
Moderated by L. Thorne McCarty, Professor of Computer Science and Law, Rutgers
University.
List of Research Presentations: (final schedule is not yet determined)
"Expert Systems in Law: The Datalex Project"
Graham Greenleaf, Andrew Mowbray, Alan L. Tyree
Faculty of Law, University of Sydney, AUSTRALIA
"The Application of Expert Systems Technology to Case-Based Law"
J.C. Smith, Cal Deedman
Faculty of Law, University of British Columbia, CANADA
"Legal Reasoning in 3-D"
Marvin Belzer
Advanced Computational Methods Center
University of Georgia, USA
"Explanation for an Expert System that Performs Estate Planning"
Dean A. Schlobohm, Donald A. Waterman
Moraga, California, USA
"Expert Systems in Law: Out of the Research Laboratory and into the
Marketplace"
Richard E. Susskind
Ernst & Whinney
London, ENGLAND
"An Expert System for Screening Employee Pension Plans for the
Internal Revenue Service"
Gary Grady, Ramesh S. Patil
Internal Revenue Service
Washington, D.C. USA
"Conceptual Legal Document Retrieval Using the RUBRIC System"
Richard M. Tong, Clifford A. Reid, Peter R. Douglas, Gregory J. Crowe
Advanced Decision Systems
Mountain View, California USA
"Conceptual Retrieval and Case Law"
Judith P. Dick
Faculty of Library and Information Science, University of Toronto
Toronto, Ontario CANADA
"A Process Specification of Expert Lawyer Reasoning"
D. Peter O'Neill
Harvard Law School
Cambridge, Massachusetts USA
"Conceptual Organization of Case Law Knowledge Bases"
Carole D. Hafner
The Center for Law and Computer Science, Northeastern University
Boston, Massachusetts USA
"A Case-Based System for Trade Secrets Law"
Edwina L. Rissland Kevin D. Ashley
Department of Computer and Information Science,
University of Massachusetts, Amherst, Massachusetts USA
"But, See, Accord: Generating Blue Book Citations in HYPO"
Kevin D. Ashley, Edwina L. Rissland
Department of Computer and Information Science
University of Massachusetts, Amherst Massachusetts USA
"A Connectionist Approach to Conceptual Information Retrieval"
Richard K. Belew
Computer Science and Engineering Department, Univ. of California
San Diego, California USA
"System = Program + Programmers + Law"
Naftaly H. Minsky, David Rozenshtein
Department of Computer Science, Rutgers University
New Brunswick, New Jersey USA
"A Natural Language Based Legal Expert System Project for Consultation
and Tutoring -- The LEX Project"
F. Haft, R.P. Jones, Th. Wetter
IBM Heidelberg Scientific Centre
Heidelberg, WEST GERMANY
"Handling of Significant Deviations from Boilerplate Text in the SPADES
System"
Gary Morris, Keith Taylor, Maury Harwood
Internal Revenue Service
Washington, D.C. USA
"Legal Data Modeling: The Prohibited Transaction Exemption Analyst"
Keith Bellairs
Management Science Department, University of Minnesota
Minneapolis, Minnesota USA
"Reasoning about `Hard' Cases in Talmudic Law
Steven Weiner
Somerville, Massachusetts USA
"Designing Text Retrieval Systems for `Conceptual Searching'"
Jon Bing
Norwegian Research Center for Computers and Law
Oslo, NORWAY
"Support for Policy Makers: Formulating Legislation with the Aid of
Logical Models"
T.J.M. Bench-Capon
Department of Computing, Imperial College
London, ENGLAND
"Further Comments on McCarty's Semantics for Deontic Logic"
Andrew J.I. Jones
University of Oslo
Oslo, NORWAY
"Experiments Using Expert Systems Technology for Teaching Law: Special
Knowledge Representation Approaches in DEFAULT and EVAN"
Roger D. Purdy
School of Law, The University of Akron
Akron, Ohio USA
"OBLOG-2: A Hybrid Knowledge Representation System for Defeasible Reasoning"
Thomas F. Gordon
FS-INFRE, GMD
Sankt Augustin, WEST GERMANY
"ESPLEX: A Rule and Conceptual Model for Representing Statutes"
Carlo Biogioli, Paola Mariana, Daniela Tiscornia
Istituto per la Documentazione Giuridica
Florence, ITALY
"A PROLOG Model of the Income Tax Act of Canada"
David M. Sherman
Maintnix Services
Thornhill, Ontario CANADA
"Some Problems in Designing Expert Systems to Aid Legal Reasoning"
Layman E. Allen, Charles S. Saxon
Law School, The University of Michigan
Ann Arbor, Michigan USA
"Precedent-Based Legal Reasoning and Knowledge Acquisition in Contract Law:
A Process Model"
Seth R. Goldman, Michael G. Dyer, Margot Flowers
Artificial Intelligence Laboratory, University of California, Los Angeles
Los Angeles, California USA
"Logic Programming for Large Scale Applications in Law: A Formalism of
Supplementary Benefit Legislation"
T.J.M. Bench-Capon, G.O. Robinson, T.W. Routen, M.J. Sergot
Department of Computing, Imperial College
London, ENGLAND
___________________________________________________________________________
Program Committee Conference Information
----------------- ----------------------
L.Thorne McCarty, Chair Prof. Carole D. Hafner, Conference Chair
Donald H. Berman (617) 437-5116
Michael G. Dyer Ms. Rita Laffey, Registration
Anne v.d. L. Gardner (617) 437-3346
Edwina L. Rissland
Marek J. Sergot
Housing Information
Special Conference Rates are available at the following hotels:
(Mention "Northeastern University Computers and Law Conference")
1. The Colonnade Hotel - $75 single/$95 double + tax ($8 parking)
120 Huntington Avenue, Boston, MA (617) 424-7000
2. The Midtown Hotel - $58 single/$63 double + tax (includes free parking)
220 Huntington Avenue, Boston, MA (617) 262-1000 or 1-800-343-1177
Both of these hotels are less than a 10-minute walk from the Conference.
Rooms have also been arranged at Boston University dormitories, a
20-minute walk from the conference, or a 10-minute bus ride and a 5-minute
walk. The rates are $29 single/$24 (per person) double. To reserve a
room in the dormitory, use the attached registration form.
SPACE IS LIMITED - RESERVE EARLY!!
Conference Registration Fee (does not include tutorial or banquet)
Regular Full-time Student
------- -----------------
Received by April 20 $95 $55
Received after April 20 $135 $85
Gala Banquest - May 28 ($40/person)
Tutorial Fee: ($50 with conference registration $100 otherwise)
Dormitory Fee ($29/night single, $24/night double)
------------------------------
-------
∂26-Mar-87 1210 BARWISE@CSLI.Stanford.EDU Re: Invitation (CSLI)
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 12:10:29 PST
Date: Thu 26 Mar 87 12:01:14-PST
From: The P.I.'s
Subject: Re: Invitation (CSLI)
Sender: BARWISE@CSLI.Stanford.EDU
To: "@<csli-lists>reception.dis"@CSLI.Stanford.EDU
Reply-To: BARWISE@CSLI.Stanford.EDU
In-Reply-To: <12289256882.22.EMMA@CSLI.Stanford.EDU>
Message-ID: <12289529398.46.BARWISE@CSLI.Stanford.EDU>
On behald of the P.I.'s, I would like to urge you to come to the
reception on Thursday. It is VERY important to give the Advisory Panel
a sense of the scope of this project, a sense it is hard to give in
the small presentations. So come and talk about what you are doing
with the Panel and the SDF Board.
Jon
-------
∂26-Mar-87 1259 LES RPG account
To: Gotelli@SCORE.STANFORD.EDU
CC: RPG@SAIL.STANFORD.EDU, JMC@SAIL.STANFORD.EDU
Dick Gabriel is a subcontractor on the Qlisp project so, as stated in my
message of 21-Mar, the RPG account should be charged to account 2-DMA705.
It might have been simpler to have asked me directly instead of asking
Dick to ask me. -Les
∂26-Mar-87 0824 RPG My SAIL Account
To: LES, JMC
Gentlemen:
Lynn Gotelli wrote me:
``Richard, If you can convince Les or John that other funds here
at Stanford should continue to pay for your <RPG@Sail> please
have one of them send me a message authorizing me to charge
your usage to a university budget account number. Thanks, Lynn''
If one of you feels thus convinced, could you please mail her such
a note?
∂26-Mar-87 1333 EPPLEY@Score.Stanford.EDU Taleen
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 13:30:33 PST
Date: Thu 26 Mar 87 13:28:35-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: Taleen
To: ZM@Sail.Stanford.EDU, JMC@Sail.Stanford.EDU
Message-ID: <12289545299.21.EPPLEY@Score.Stanford.EDU>
She just phoned to say she would not be in until around 3:00 p.m.
LaDonna
-------
∂26-Mar-87 1512 LES RWW account
To: Gotelli@SCORE.STANFORD.EDU
CC: ME@SAIL.STANFORD.EDU, RWW@SAIL.STANFORD.EDU, JMC@SAIL.STANFORD.EDU
Richard Weyhrauch's account RWW@Sail should be made into a CSD-CF overhead
account, to be used for maintenance of the FOL program. -Les
∂26-Mar-87 1643 NSH Bellin/Ketonen report
To: JMC
CC: JK, GLB
I feel the report, "Experiments in Automatic Theorem Proving"
deserves to be published as a technical report, and I will
try to make a case before. I havent read it completely or
thoroughly but I did go through a third of it some time ago.
My reasons are:
1. It is the most readable introduction to the use of EKL.
2. Though the theorems that were proved cannot be regarded as
difficult by the standards of what can be proved by other
theorem-provers, the proofs should be considered as
benchmarks to demonstrate the capability and use of EKL,
and to compare it with other proof-checking systems.
3. The report emphasizes how the different representations affect
the efficiency of the proof - this is a key difference between
formal and informal proofs.
4. My general bias is that such experiments are important -
many provers have been implemented but only a few of them have
been used, and also that the results of such experiments should
be reported so that others interested in using EKL can judge its
capabilities and observe how it is used.
5. It is also a rare example of a proof which employs higher-order
logic (allegedly) to some effect.
6. The paper is a well-written description of a mechanical proof -
that too is rare.
Shankar
∂26-Mar-87 1911 @SUMEX-AIM.STANFORD.EDU,@NTT-20:masahiko@nttlab your visit
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 26 Mar 87 19:11:20 PST
Received: from NTT-20 by SUMEX-AIM.STANFORD.EDU with Cafard; Thu 26 Mar 87 19:05:54-PST
Received: from nttlab.ntt.junet by NTT-20.NTT.JUNET with TCP; Fri 27 Mar 87 10:56:13
Received: by nttlab.ntt.junet (4.12/5.0N) with TCP; Fri, 27 Mar 87 10:57:20 jst
Date: Fri, 27 Mar 87 10:57:20 jst
From: masahiko%ntt.junet@nttlab (Masahiko Sato)
Message-Id: <8703270157.AA10332@nttlab.ntt.junet>
To: jmc%sail.stanford.edu%sumex-aim@ntt-20,
clt%sail.stanford.edu%sumex-aim@ntt-20
Subject: your visit
Dear John and Carolyn,
Mr. Hosoi of IBM is arranging your visit to IBM Tokyo Research Center.
They are planning to have your visit to IBM from 10am to 3pm on April
6. Mr. Hosoi will call you at the Marunouchi Hotel.
Have a nice trip to Japan.
** masahiko **
∂27-Mar-87 0148 TVR@CCRMA-F4
Received: from CCRMA-F4 by SAIL with PUP; 27-Mar-87 01:48 PST
Date: 27 Mar 87 0148 PST
From: Tovar <TVR%CCRMA-F4@SAIL.Stanford.EDU>
To: JMC@SAIL.STANFORD.EDU
Oh, i happened to spot someone reading our private mailing list, and i know
some folk on it probably value their privacy. The person said he was looking
for a bibliographic reference, but perhaps curiousity got the best of this
person.
∂27-Mar-87 0822 EPPLEY@Score.Stanford.EDU Chairs
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 08:22:25 PST
Date: Fri 27 Mar 87 08:20:24-PST
From: LaDonna Eppley <EPPLEY@Score.Stanford.EDU>
Subject: Chairs
To: JMC@Sail.Stanford.EDU
Message-ID: <12289751339.15.EPPLEY@Score.Stanford.EDU>
I just wanted to convey my congratulations. I was unable to attend last
night's presentation. However, I did get to see the beautiful chairs,
and I hope that you will bring us some pictures of Timothy in his new
chair.
LaDonna
-------
∂27-Mar-87 0830 GARDNER@CSLI.Stanford.EDU re: An invitation
Received: from CSLI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 08:29:59 PST
Date: Fri 27 Mar 87 08:27:44-PST
From: Anne Gardner <GARDNER@CSLI.Stanford.EDU>
Subject: re: An invitation
To: JMC@Sail.Stanford.EDU
In-Reply-To: Message from "John McCarthy <JMC@SAIL.STANFORD.EDU>" of Fri 27 Mar 87 00:39:00-PST
Message-ID: <12289752675.24.GARDNER@CSLI.Stanford.EDU>
That is very good news. I'm sure Carole Hafner will be in touch
with you shortly.
Anne
-------
∂27-Mar-87 0900 JMC
qlisp
∂27-Mar-87 0955 CLT Flights
jmc+clt sat 28 mar UA 809 sf-osaka 2:10pm 6:40pm (29 mar)
clt wed 8 apr UA 58 nrt-sf 5:40pm 10:45am (8 apr)
jmc wed 10 apr UA 58 nrt-sf 5:40pm 10:45am (10 apr)
∂27-Mar-87 1013 AIR Richard Stallman
Do you know Stallman's telephone number?
∂27-Mar-87 1031 VAL re: name
[In reply to message rcvd 26-Mar-87 22:26-PT.]
Fantastic! Actually, there is a precedent: Marquis de L'Hopital sponsored
Johann Bernoulli's research when the latter discovered what is now known as
L'Hopital's rule.
∂27-Mar-87 1042 VAL The frame problem workshop
Would it be too much trouble if I ask you to give my talk at Lawrence? If you
can just show a few slides regarding the Yale shooting and answer the questions,
that would be more than enough; I don't mean to ask you to go into the
technical details of the generalizations at the end of the paper. Or, if you
prefer, I can ask Matt to do that for me.
∂27-Mar-87 1240 VAL re: The frame problem workshop
[In reply to message rcvd 27-Mar-87 12:13-PT.]
Thank you very much.
∂27-Mar-87 1340 RLG McDermott
if you have any papers or paper fragments responding to any of McDermott's
recent criticisms, i'd be interested in getting a hold of them before
you leave...
thanx...
∂27-Mar-87 1408 TALEEN@Score.Stanford.EDU Thanks for the book!
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 14:08:45 PST
Date: Fri 27 Mar 87 14:06:47-PST
From: Taleen Marashian <TALEEN@Score.Stanford.EDU>
Subject: Thanks for the book!
To: jmc@Sail.Stanford.EDU
Message-ID: <12289814398.28.TALEEN@Score.Stanford.EDU>
This is to say thanks for the book. It's a lot of fun, but I think I have
a problem: practically the only answers I got right are the ones in Section 18:
CHILDREN'S HOUR. I hope that this doesn't imply anything! I did get a couple
of the "picture" questions and from Shakespeare, but this is a a tough book!
Have a wonderful weekend,
Taleen
P.S. I am dying to see what Timothy looks like now. That photo of him at the
terminal (at Christmas time) is really cute.
-------
∂27-Mar-87 1428 MAYR@score.stanford.edu Joel Friedman
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 14:28:07 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Fri, 27 Mar 87 14:26:31 PST
Date: Fri 27 Mar 87 14:25:37-PST
From: Ernst W. Mayr <MAYR@score.stanford.edu>
Subject: Joel Friedman
To: fndsch@navajo.stanford.edu
Message-Id: <12289817827.30.MAYR@Score.Stanford.EDU>
I just talked to him on the phone. Here is the list of his top preferences
in academia: 1. MIT math 2. UCLA math 3. Princeton cs.
Of course, he hasn't made a decision yet. As soon as he does, he'll let us
know.
Obvious proposal: let's have a meeting.
-ernst
-------
∂27-Mar-87 1550 WINOGRAD@Score.Stanford.EDU Paper of yours
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 15:50:17 PST
Date: Fri 27 Mar 87 15:48:00-PST
From: WINOGRAD@CSLI.STANFORD.EDU
Subject: Paper of yours
To: jmc@sail.STANFORD.EDU
Cc: WINOGRAD@CSLI.STANFORD.EDU
A while back I asked you about a paper of yours and you sent me a copy
of your Home TErminal paper. I have now realized that the paper I
really meant was entitled "Mathematics and objectivity in human
affairs". Did that ever get published in any form? --t
∂27-Mar-87 1705 WINOGRAD@Score.Stanford.EDU re: Paper of yours
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 27 Mar 87 17:05:01 PST
Date: Fri 27 Mar 86 17:03:00-PST
From: WINOGRAD@CSLI.STANFORD.EDU
Subject: re: Paper of yours
To: JMC@SAIL.STANFORD.EDU
Thanks. --t
∂28-Mar-87 1920 coraki!pratt@sun.com Meeting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 28 Mar 87 19:19:58 PST
Received: from SUN.COM by navajo.stanford.edu with TCP; Sat, 28 Mar 87 19:17:53 PST
Received: from sun.Sun.COM by Sun.COM (3.2/SMI-3.2)
id AA04921; Sat, 28 Mar 87 19:15:38 PST
Received: by sun.Sun.COM (3.2/SMI-3.2)
id AA06545; Sat, 28 Mar 87 19:19:52 PST
Received: by coraki.uucp (3.2/SMI-1.2)
id AA06876; Sat, 28 Mar 87 19:18:24 PST
Date: Sat, 28 Mar 87 19:18:24 PST
From: coraki!pratt@sun.com (Vaughan Pratt)
Message-Id: <8703290318.AA06876@coraki.uucp>
To: fndsch@navajo.stanford.edu
Subject: Meeting
It would seem a good idea to meet again to discuss our preferences under
the latest assumptions.
-v
∂30-Mar-87 1024 guibas@src.dec.com meeting: friday 4/3, 4:00 pm
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Mar 87 10:24:15 PST
Received: from src.dec.com by navajo.stanford.edu with TCP; Mon, 30 Mar 87 10:22:12 PST
Received: by src.dec.com (5.54.3/4.7.34)
id AA08131; Mon, 30 Mar 87 10:23:03 PST
Date: Mon, 30 Mar 87 10:23:03 PST
From: guibas@src.dec.com (Leonidas Guibas)
Message-Id: <8703301823.AA08131@src.dec.com>
To: fndsch@navajo.stanford.edu
Cc: guibas@src.dec.com
Subject: meeting: friday 4/3, 4:00 pm
i think it would be appropriate for us to have another meeting this week
and plan our our final strategy. let's try again for friday, 4/3, at 4:00
pm.
phyllis, can you please reserve a room?
l.
∂30-Mar-87 1140 lunt@portia.STANFORD.EDU
Received: from PORTIA by SAIL.STANFORD.EDU with TCP; 30 Mar 87 11:39:54 PST
Received: by portia.STANFORD.EDU; Mon, 30 Mar 87 11:40:12 PST
Date: Mon, 30 Mar 87 11:40:12 PST
From: Steve Lunt <lunt@portia.STANFORD.EDU>
To: jmc@sail.Stanford.EDU
Professor McCarthy,
I am a Master's student and wish to take CS248B (Computer Graphics)
as an elective in the Software Theory area. Last quarter I took CS248A
as an elective. Would you approve CS248B as an elective?
Thank you.
Steve Lunt
∂30-Mar-87 1607 RA Lisa from Custom Floors
Lisa called re floor damage insurance. Her tel. (408) 374 6286
∂30-Mar-87 1609 RA Fred Thulin
Thulin left a msg. on your machine but forgot to give you his tel. no. which
is (312) 753 6950. He wanted to invite you to a colloquium next year. He is
from Northern Illinois University.
∂30-Mar-87 1750 NILSSON@Score.Stanford.EDU paper
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 30 Mar 87 17:50:31 PST
Date: Mon 30 Mar 87 17:48:27-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: paper
To: jmc@Sail.Stanford.EDU
cc: nilsson@Score.Stanford.EDU
Message-ID: <12290641183.31.NILSSON@Score.Stanford.EDU>
John, I've finished reading your Math Logic in AI paper; too late
to give it to you before you left for Japan I'm sorry to say.
It looks fine to me. I've made a few notations and comments in
the margins, so you can pick it up from my office when you return.
Also, by that time, I should have a draft of what I propose to send
to Kirsh. I think we still have two separate papers. Mine looks
like it will have a somewhat different emphasis. -Nils
-------
∂31-Mar-87 0808 PHY@sail.stanford.edu meeting
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 31 Mar 87 08:07:59 PST
Received: from Sail.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 31 Mar 87 08:06:31 PST
Date: 31 Mar 87 0807 PST
From: Phyllis Winkler <PHY@sail.stanford.edu>
Subject: meeting
To: fndsch@navajo.stanford.edu
Room 301 has been reserved for the Theory Search committee at 4:00
Friday, April 3. -Phyllis
∂31-Mar-87 1451 ULLMAN@score.stanford.edu [Gadi Landau <gadi%TAURUS.BITNET@wiscvm.wisc.edu>:]
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 31 Mar 87 14:51:32 PST
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 31 Mar 87 14:49:44 PST
Date: Tue 31 Mar 87 14:44:29-PST
From: Jeffrey D. Ullman <ULLMAN@score.stanford.edu>
Subject: [Gadi Landau <gadi%TAURUS.BITNET@wiscvm.wisc.edu>:]
To: fndsch@navajo.stanford.edu
Message-Id: <12290869837.40.ULLMAN@Score.Stanford.EDU>
I just got this over the net.
Any interest?
By the way, Scheiber just told me he has decided to take a
Yorktown postdoc instead of his Weizmann; it paid 50\% more than we
were offering him (and could legally pay under the Weizmann rules_.
I'm sorry to hear that; I was assured through the grapevine that
he was the best of the Israeli lot this year.
It also means that his fellowship will be reoffered to someone else,
and we'll get another pitch in a few weeks.
---jeff
---------------
Return-Path: <@wiscvm.wisc.edu:gadi@taurus.BITNET>
Received: from wiscvm.wisc.edu by SCORE.STANFORD.EDU with TCP; Tue 31 Mar 87 09:35:50-PST
Received: from taurus by wiscvm.wisc.edu on 03/31/87 at 11:37:25 CST
Received: by taurus (5.51/ta.1.3.R)
id AA07330; Tue, 31 Mar 87 13:10:07 +0200
Return-Path: <gadi@taurus.BITNET>
Date: Tue, 31 Mar 87 13:10:07 +0200
From: Gadi Landau <gadi%TAURUS.BITNET@wiscvm.wisc.edu>
Message-Id: <8703311110.AA07330@taurus>
To: ullman@score.stanford.edu
Dear Professor Ullman,
I got my Ph.D. degree in computer science recently. The thesis deals
with new serial and parallel algorithms for string matching in the
presence of errors. My thesis advisor was Prof. U. Vishkin at
Tel Aviv University.
A few months ago, I applied for a position in your department.
(Prof. Guibas should have my file.)
A few days ago, I was awarded the Fulbright Post-Doctoral Fellowship.
This fellowship provides modest cover of my expenses for one year.
Will it be possible to spend this year at your department?
The regulations of the Fulbright Fellowship allows me to get additional
$10000 from the host institution. In case your department is ready to
host me, will it possible to pay me this $10000? Also, will it be
possible to cover my transportation expenses?
Sincerely yours,
Gad M. Landau
PS. Enclosed please find an updated list of publications.
LIST OF PUBLICATIONS
1) G.M. Landau, M.M. Yung, and Z. Galil, "Distributed algorithms
in synchronous broadcasting networks", Proc. 12th ICALP, Lecture
Notes in Computer Science 194, Springer-Verlag, 1985, 363-372.
2) G.M. Landau and U. Vishkin, "Efficient string matching in the
presence of errors", Proc. 26th IEEE Symposium on Foundation
of Computer Science 1985, 126-136.
3) G.M. Landau and U. Vishkin "Efficient string matching with
k mismatches", Theoretical Computer Science, 43 (1986) 239-249.
4) G.M. Landau, U. Vishkin and R. Nussinov "An efficient string matching
algorithm with k differences for nucleotide and amino acid
sequences ", Nucleic Acid Research 14 (1) (1986) 31-46.
5) G.M. Landau and U. Vishkin, "Efficient string matching with k
differences", TR-36/85, Department of Computer Science, Tel Aviv
University, 1985, submitted for journal publication.
6) G.M. Landau and U. Vishkin, "Introducing efficient parallelism
into approximate string matching", Proc. 18th ACM Symposium on
Theory of Computing, 1986, 220-230.
7) Z. Galil, G.M. Landau and M.M. Yung, "Distributed algorithms
in synchronous broadcasting networks", Theoretical Computer
Science, to appear.
8) G.M. Landau, U. Vishkin and R. Nussinov, "An efficient string
matching algorithm with k substitutions for nucleotide and amino
acid sequences ", Journal of Theoretical Biology, to appear.
9) G.M. Landau and U. Vishkin, "Fast parallel and serial approximate
string matching", submitted for journal publication.
10) G.M. Landau, B. Schieber, and U. Vishkin, "Parallel Construction of
a Suffix Tree". Proc. 14th ICALP, to appear.
11) G.M. Landau, U. Vishkin and R. Nussinov "Locating alignments with
K differences for nucleotide and amino acid sequences" in preparation.
-------
∂31-Mar-87 1531 @Score.Stanford.EDU:MAD@Sushi.Stanford.EDU Sarah Thomas--CS PhD admittee
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 31 Mar 87 15:30:59 PST
Received: from Sushi.Stanford.EDU by SCORE.STANFORD.EDU with TCP; Tue 31 Mar 87 15:28:38-PST
Date: Tue 31 Mar 87 15:28:29-PST
From: Marcia A. Derr <MAD@Sushi.Stanford.EDU>
Subject: Sarah Thomas--CS PhD admittee
To: mccarthy@Score.Stanford.EDU
Message-ID: <12290877846.42.MAD@Sushi.Stanford.EDU>
Sarah Thomas, one of the new CS Phd admittees, will be visiting
Stanford on Thrusday, April 9th. She's interested in AI and would like
to speak with you. How is 4:00-4:30pm that Thursday?
Thanks,
Marcia
-------
∂31-Mar-87 1726 NILSSON@Score.Stanford.EDU ["Dr. Ron Green" (ARO | mort) <green@BRL.ARPA>: White Papers on Basic Research in AI]
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 31 Mar 87 17:25:54 PST
Date: Tue 31 Mar 87 17:23:16-PST
From: Nils Nilsson <NILSSON@Score.Stanford.EDU>
Subject: ["Dr. Ron Green" (ARO | mort) <green@BRL.ARPA>: White Papers on Basic Research in AI]
To: Feigenbaum@SUMEX-AIM.Stanford.EDU, Genesereth@SUMEX-AIM.Stanford.EDU,
WINOGRAD@CSLI.Stanford.EDU, JMC@Sail.Stanford.EDU,
Rosenbloom@SUMEX-AIM.Stanford.EDU, Buchanan@SUMEX-AIM.Stanford.EDU,
BINFORD@Whitney.Stanford.EDU, Shortliffe@SUMEX-AIM.Stanford.EDU,
shoham@Score.Stanford.EDU, latombe@Whitney.Stanford.EDU,
nilsson@Score.Stanford.EDU
Message-ID: <12290898741.40.NILSSON@Score.Stanford.EDU>
Here's an interesting annoucement for those who might not have seen it. -Nils
---------------
Return-Path: <@SRI-STRIPE.ARPA,@SRI-WARBUCKS.ARPA:LAWS@SRI-STRIPE.ARPA>
Received: from SRI-STRIPE.ARPA by SCORE.STANFORD.EDU with TCP; Fri 20 Mar 87 10:16:53-PST
Received: from SRI-WARBUCKS.ARPA by SRI-STRIPE.ARPA with TCP; Fri 20 Mar 87 10:19:22-PST
Received: from SRI-STRIPE.ARPA by SRI-WARBUCKS.ARPA via SMTP with TCP;
Fri, 20 Mar 87 09:35:58-PST
Return-Path: <green@BRL.ARPA>
Received: from BRL-SMOKE.ARPA by SRI-STRIPE.ARPA with TCP; Thu 19 Mar
87 12:06:40-PST
Date: Thu, 19 Mar 87 8:21:42 EST
From: "Dr. Ron Green" (ARO | mort) <green@BRL.ARPA>
To: ailist-request@sri-stripe.arpa
cc: green@BRL.ARPA
Subject: White Papers on Basic Research in AI
ReSent-Date: Fri 20 Mar 87 09:14:15-PST
ReSent-From: Ken Laws <Laws@SRI-STRIPE.ARPA>
ReSent-To: aic-staff@SRI-STRIPE.ARPA
ReSent-Message-ID: <12287926134.22.LAWS@SRI-STRIPE.ARPA>
The Army Research Office would be interested in receiving
short white papers on proposed "Basic Research" in AI.
The pepers should discuss a planned three year research
effort with technical content discussing merits of research
topic. Mail the white papers to the following address:
US Army Research Office
P.O. Box 12211
Electronics Division(Attn: Dr. C. Ronald Green)
Research Triangle Park, NC 27709-2211
Topics of interest are purely AI as well as related topics
as applied to Computer Science.
I would prefer the "white papers" as opposed to a deluge of
telephone calls. E-mail responses will also be acceptable.
green@brl.arpa
Thanks
Ron Green
-------
∂01-Apr-87 0815 RA flight reservation for Lawrence Kensas
You will have to fly to Kensas city. Since there are no flights into Lawrence,
I rented a compact car for you with Hertz. It is a 30 mile drive.
SF-Kensas City, April 12, Eastern 200 7:34am arr. 12:35pm (later flights
will get you into Kensas after 5:00pm).
Kensas City-SF, April 15, Continental 4439 4:20pm (via Denver), arr. 7:17pm.
Dina Bolla will deliver the tickets next week.
∂01-Apr-87 1203 PETTY@RED.RUTGERS.EDU '87-April-tecrpts-mailinglist
Received: from RED.RUTGERS.EDU by SAIL.STANFORD.EDU with TCP; 1 Apr 87 12:03:05 PST
Date: 1 Apr 87 14:47:54 EST
From: PETTY@RED.RUTGERS.EDU
Subject: '87-April-tecrpts-mailinglist
To: arpanet.mail: ;
cc: petty@RED.RUTGERS.EDU
Message-ID: <12291099834.15.PETTY@RED.RUTGERS.EDU>
@make(text)
@begin(description)
Below is a list of our newest technical reports.
The abstracts for these are available for access via FTP with user account
<anonymous> with any password. The file name is:
<library>tecrpts-online.doc
If you wish to order copies of any of these reports please send mail via the
ARPANET to PETTY@RUTGERS. Thank you!!
[ ] CBM-TR-148 - "AUTOMATIC KNOWLEDGE BASE REFINEMENT FOR
CLASSIFICATION SYSTEMS," A. Ginsberg, S.M. Weiss and P. Politakis.
[ ] CBM-TR-149 - "AN EXPERT SYSTEMS METHODOLOGY FOR CONTROL AND
INTERPRETATION OF APPLICATIONS SOFTWARE," C.V.
Apte and S.M. Weiss.
[ ] DCS-TR-201 - "SOME FORMAL PROPERTIES OF VERSION SPACES," A.
Van der Mude.
[ ] DCS-TR-202 - "ON THE SUPERMODULAR KNAPSACK PROBLEM," G. Gallo
and B. Simeone.
[ ] DCS-TR-205 - "RELATIVE KNOWLEDGE IN A DISTRIBUTED DATABASE,"
T. Imielinski.
[ ] DCS-TR-206 - "COMPLEXITY OF QUERY PROCESSING IN THE DEDUCTIVE
DATABASES WITH INCOMPLETE INFORMATION," T. Imielinski.
[ ] DCS-TR-207 - "DOMAIN ABSTRACTION AND LIMITED REASONING," T.
Imielinski.
[ ] DCS-TR-208 - "REPRESENTATION SELECTION FOR CONSTRAINT
SATISFACTION PROBLEMS: A CASE STUDY USING n-QUEENS," B.A. Nadel.
[ ] LCSR-TR-86 - "APPROXIMATING THE DIAMETER OF A SET OF POINTS IN
THE EUCLIDEAN SPACE," O. Egecioglu and B. Kalantari.
[ ] LCSR-TR-87 - "MINIMUM COST NETWORK FLOW PROBLEM ON SPANNING
TREES AND 1-TREES," B. Kalantari and I. Kalantari.
[ ] LCSR-TR-88 - "NYSTROM'S ITERATIVE VARIANT METHODS FOR THE
SOLUTION OF CAUCHY SINGULAR INTEGRAL EQUATIONS," A. Gerasoulis.
[ ] ML-TR-7 - "(THESIS) - (If you wish to order this thesis, a
prepayment of $15.00 is required.) "THE ROLE OF EXPLICIT CONTEXTUAL
KNOWLEDGE IN LEARNING CONCEPTS TO IMPROVE PERFORMANCE," R.M. Keller.
@end(description)
-------
∂01-Apr-87 1701 VAL Charles M. Pigott circumscription
Benjamin came up with some ideas that vaguely reminded me of CMP circ'n, and
I showed him your definition. I hope you don't mind.
∂02-Apr-87 1250 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 2 April 1987
Previous Balance 10.65
Payment(s) 10.65 (check 3/4/87)
-------
Current Charges 0.30 (coffee, tea and hot chocolate)
4.00 (bicycle lockers)
1.00 (vending machine)
-------
TOTAL AMOUNT DUE 5.30
NEW PAYMENT DELIVERY LOCATION: CSD Receptionist.
Please deliver payments to the Computer Science Dept receptionist, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Note: The recording of a payment takes up to three weeks after the payment is
made, but never beyond the next billing date. Please allow for this delay.
Bills are payable upon presentation. Interest of 1.0% per month will be
charged on balances remaining unpaid 25 days after bill date above.
An account with a credit balance earns interest of .33% per month,
based on the average daily balance.
∂02-Apr-87 2359 JJW Meeting
To: JMC@SAIL.STANFORD.EDU, RPG@SAIL.STANFORD.EDU,
Ullman@SCORE.STANFORD.EDU
I'd like to arrange a meeting to discuss my thesis, as described in the
PhD program requirements. Some time in May would be best for me. Can you
let me know when you are available for this? (JMC is out of town until
about April 10 so it will be a while before I can reply to your reply.)
Joe
∂03-Apr-87 0900 JMC
qlisp
∂03-Apr-87 1121 RA Dr. Brown, Univ. of Kensas
Brown wanted to ask you whether you'd be willing to serve on a panel during
the conference. His tel. (913) 864 4482. He said you can think about it and
let him know when you get there.
∂03-Apr-87 1534 RA Frank Harary
Harary (MCC) came by to say hello. His tel. (512) 338-3493.
∂03-Apr-87 2342 REGES@Score.Stanford.EDU do you mind?
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 3 Apr 87 23:42:28 PST
Date: Fri 3 Apr 87 23:40:06-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: do you mind?
To: jmc@Sail.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12291753774.19.REGES@Score.Stanford.EDU>
I have CS101 down for TTh 4:15-5:30 for next winter in order to get it in a TV
classroom. If you don't like this time, we can choose something more civilized
by moving it off of TV. Please advise.
-------
∂04-Apr-87 0345 REGES@Score.Stanford.EDU scheduling message #1
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Apr 87 03:45:35 PST
Date: Sat 4 Apr 87 03:41:59-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: scheduling message #1
To: "Possible instructors": ;
Office: CS-TAC 22, 723-9798
Message-ID: <12291797807.19.REGES@Score.Stanford.EDU>
Many of you already know that I'm trying to work up a schedule of courses for
CS for '87-88. If you are receiving this mail, then you have been identified
as someone who might be teaching a CS course next year. I have worked with the
TV people to choose courses and times for next year's televised offerings. For
other courses I have used traditional times or requested times, unless I saw a
conflict with other courses, in which case I tried to slightly alter the time.
I am asking your help in checking over this schedule. If you plan to teach a
course, it should be listed in my master schedule and you should check its time
to make sure it is acceptable to you. If you see your name by courses you don't
plan to teach or if courses you plan to teach are missing, please send me mail
immediately and give me the details.
I will carry out the checking process with three messages: this first message
to introduce the process; a second individualized message showing all courses
you appear to be teaching next year; and a third monster message with the
entire schedule.
Please at least check over the second individualized message. If you get no
second message, then I have no indication that you are teaching next year. If
you also have time to look over the monster message and help me to identify
problems/conflicts, I would greatly appreciate it. You should at least look
at the other courses taught at the same time as your course to identify
conflicts for your classes.
As always, this is just a draft. But perhaps we can spend enough time now to
make it a fairly accurate draft. Thanks in advance for the help.
-------
∂04-Apr-87 0417 REGES@Score.Stanford.EDU Scheduling message #2
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Apr 87 04:16:52 PST
Date: Sat 4 Apr 87 04:13:28-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: Scheduling message #2
To: jmc@Sail.Stanford.EDU
Office: CS-TAC 22, 723-9798
Message-ID: <12291803540.10.REGES@Score.Stanford.EDU>
Below is a list of the CS courses you are scheduled to teach in '87-88 and
the time (if any) that has been established for it. Please contact me if:
you aren't planning to teach one of the listed courses; you are planning to
teach a course in addition to the listed courses; or you can't accept the
scheduled time for your course. Your prompt reply will be greatly
appreciated.
Win CS101 McCarthy TTh 4:15-5:30 on the TV network
-------
∂04-Apr-87 0444 REGES@Score.Stanford.EDU Scheduling message #3
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 4 Apr 87 04:44:44 PST
Date: Sat 4 Apr 87 04:39:18-PST
From: Stuart Reges <REGES@Score.Stanford.EDU>
Subject: Scheduling message #3
To: "Possible instructors": ;
Office: CS-TAC 22, 723-9798
Message-ID: <12291808241.19.REGES@Score.Stanford.EDU>
Now that you've (hopefully) received your individual message, please glance over
the following lengthy list to locate your courses and see if there are other
courses taught at the same time that seem to conflict. If you can take some
time to help me identify other problems, please do so.
Autumn '88-89
Days Time Course Instructor TV? Notes
-------------------------------------------------------------------------------
MWF 9:00-9:50 022 Schoen yes
MWF 9:00-9:50 106B Staff no
MWF 9:00-9:50 106X Gorin yes
MWF 9:00-9:50 260 Wilf no
MWF 9:00-9:50 312A Flynn yes enroll in EE382A
MWF 10:00-10:50 106A Staff no
MWF 10:00-10:50 106H Floyd no
MWF 10:00-10:50 143A Linton yes
MWF 11:00-11:50 108A Rogers yes
MWF 11:00-11:50 112 Weise yes enroll in EE182
MWF 11:00-11:50 237A Staff no
MWF 11:00-11:50 242 Ungar no
F 12:05-1:30 522 Staff no SigLunch, Chem Gazebo
MWF 1:15-2:05 108B Wilson no
MWF 1:15-2:05 209 Knuth yes (1-time writing course)
MWF 2:15-3:05 003 Reges yes/no taped but no broadcast
MWF 2:15-3:05 105A Jones no
MWF 2:15-3:05 140 Rogers yes
MWF 3:15-4:05 040 Wilson yes
MWF 3:15-4:05 161 Staff yes new combo of 260/261
M 4:15-5:05 510 McCluskey no enroll in EE385A
M 4:15-5:05 527 Binford no Cedar conference
M 4:15-5:05 530 Golub no MJH 352
W 4:15-5:30 540 Staff yes enroll in EE380
MW 7:00-7:50 197 Reges/Staff no LOTS consulting
TTh 9:30-10:45 157 Manna yes new logic course
TTh 9:30-10:45 353 Pratt no
TTh 9:30-10:45 409 Green/Smith no
T 11:00-12:15 151 Reges yes
TTh 11:00-12:15 244 Cheriton yes
TTh 11:00-12:15 367A Mayr no alternate years
TTh 12:15-1:05 270 Fagn/Short/Wied no same as MIS 210
TTh 1:15-2:30 240A Staff yes
TTh 1:15-2:30 212 Hennessy yes enroll in EE282
TTh 1:15-2:30 327C Roth no enroll in ME219A
TTh 2:45-4:00 110 Chou yes
TTh 2:45-4:00 137 Staff yes
TTh 2:45-4:00 211 Staff yes enroll in EE381
TTh 2:45-4:00 306 Shankar no
T 4:15-5:30 500 Staff yes
Th 4:15-5:30 300 Earnest no
Th 4:15-5:05 548 Cheriton no MJH 352
TTh 4:15-5:05 198H Smith/McGrory no
TTh 7:00-7:50 196 Reges/Staff no consulting for micros
TBA 001C Reges/Staff no
TBA 309A Sowa no Industrial Lecturship
TBA 328A Pavel no same as Psych187
TBA 366 Staff no
by arrangement 001A Reges/Staff no dorm based
by arrangement 001D Reges/Staff no dorm based
by arrangement 191 Multiple Staff no
by arrangement 192 Reuling no
by arrangement 199 Multiple Staff no
by arrangement 199P Multiple Staff no
by arrangement 393 Multiple Staff no
by arrangement 399 Multiple Staff no
by arrangement 499 Multiple Staff no
by arrangement 801 Multiple Staff no
by arrangement 802 Multiple Staff no
Winter '87-88
Days Time Course Instructor TV Notes
-------------------------------------------------------------------------------
MWF 9:00-9:50 108A Rogers no
MWF 10:00-10:50 106B Staff no
MWF 10:00-10:50 247 Allison no
MWF 10:00-10:50 275 Kay no
MWF 11:00-11:50 108B Wilson yes
MWF 11:00-11:50 112 Staff no enroll in EE182
MWF 11:00-11:50 237B Staff no
MWF 11:00-11:50 245 Wiederhold yes
F 12:05-1:30 522 Staff no SigLunch, Chem Gazebo
MWF 12:50-2:05 223 Genes./Nilsson yes
MWF 1:15-2:05 105A Jones no
MWF 1:15-2:05 106A Reges yes
MWF 1:15-2:05 106X Staff no
MWF 1:15-2:05 360 Knuth no alternate years
MF 2:15-3:05 241 Wilson yes
F 2:15-4:05 356 Halpern yes
MWF 3:15-4:05 021 Rogers yes
MWF 3:15-4:05 149 Bryan yes
MWF 3:15-4:05 154 Ullman yes new formal lang course
MWF 3:15-4:05 154N Ullman yes just 154's NP-Cmpletnss
MWF 3:15-4:05 262 Floyd no
MW 3:15-4:30 364 Papadimitriou no
M 4:15-5:05 510 McCluskey no enroll in EE385A
M 4:15-5:05 527 Binford no Cedar conference
M 4:15-5:05 530 Golub no MJH 352
W 4:15-5:30 540 Staff yes enroll in EE380
MW 7:00-7:50 197 Reges/Staff no LOTS consulting
TTh 8:00-9:15 329 LaTombe yes (new Planning course)
TTh 9:30-10:45 110 Gill yes
TTh 9:30-10:45 248A Guibas yes
TTh 9:30-10:45 257 Waldinger no
TTh 9:30-10:45 264 Dantzig no
TTh 9:30-10:45 265 Tobagi no enroll in EE284
TTh 9:30-10:45 358 Floyd no alternate years
TTh 11:00-12:15 224 Rosenbloom yes
TTh 11:00-12:15 367B Mayr no alternate years
TTh 12:15-1:05 271A Shortliffe no same as MIS 211A
TTh 1:15-2:30 157 Jones yes new logic course
TTh 1:15-2:30 243 Weise yes
TTh 1:15-2:30 327B Binford yes
TTh 2:45-4:00 211 Staff yes enroll in EE381
TTh 2:45-4:00 240A Linton yes
TTh 2:45-4:00 244 Staff no enroll in EE384
TTh 2:45-4:00 304 Staff no
TTh 2:45-4:00 326 Lifschitz no
TTh 4:15-5:30 101 McCarthy yes
TTh 4:15-5:05 198H Smith/McGrory no
T 4:15-5:30 500 Staff yes
Th 4:15-5:05 548 Cheriton no MJH 352
TTh 7:00-7:50 196 Reges/Staff no consulting for micros
TBA 001C Reges/Staff no
TBA 309B Dwork no Industrial Lecturship
TBA 523 Buchanan/Staff no AI qual course
by arrangement 001A Reges/Staff no dorm based
by arrangement 001D Reges/Staff no dorm based
by arrangement 191 Multiple Staff no
by arrangement 192 Reuling no
by arrangement 199 Multiple Staff no
by arrangement 199P Multiple Staff no
by arrangement 393 Multiple Staff no
by arrangement 399 Multiple Staff no
by arrangement 499 Multiple Staff no
by arrangement 801 Multiple Staff no
by arrangement 802 Multiple Staff no
Spring '87-88
Days Time Course Instructor TV Notes
-------------------------------------------------------------------------------
MWF 9:00-9:50 106A Staff no
MWF 9:00-9:50 108B Wilson no
MWF 9:00-9:50 140 Wilson yes
MWF 10:00-10:50 075 Kay no
MWF 10:00-10:50 105A Rogers no
MWF 10:00-10:50 106X Gorin yes
MWF 10:00-10:50 161 Staff yes new combo of 260/261
MWF 10:00-10:50 254 Floyd no
MWF 11:00-11:50 237C Staff no
MWF 11:00-11:50 323 Nilsson/Genes. yes
F 12:05-1:30 522 Staff no SigLunch, Chem Gazebo
MW 12:50-2:05 110 Chou yes
MW 12:50-2:05 357 Manna yes
MWF 1:15-2:05 106B Reges yes
MWF 1:15-2:05 108A Ullman no
MWF 1:15-2:05 154 Rogers yes new formal lang course
MWF 1:15-2:05 154N Rogers yes just 154's NP-Cmpletnss
MWF 2:15-3:05 345 Staff yes
MWF 3:15-4:05 143A Staff yes
MWF 3:15-4:05 242 Ungar yes
MWF 3:15-4:30 371 Holtzman no same as MIS235, EES235
M 4:15-5:05 510 McCluskey no enroll in EE381
M 4:15-5:05 527 Binford no Cedar conference
M 4:15-5:05 530 Golub no MJH 352
W 4:15-5:30 540 Staff yes enroll in EE380
MW 7:00-7:50 197 Reges/Staff no LOTS consulting
TTh 8:00-9:15 014 Buneman no
TTh 9:30-10:45 344 Tobagi no enroll in EE484
TTh 9:30-10:45 225A Genesereth yes
TTh 9:30-10:45 273 Bigelow no
TTh 9:30-10:45 340 Cheriton yes
TTh 11:00-12:15 277 Perrault/Cohen no
TTh 11:00-12:15 335 Staff no
T 11:00-12:15 520 Nilsson yes
TTh 12:15-1:05 271B Fagn/Coop/Buch no same as MIS 211B
Th 1:15-4:15 368 Guibas no
TTh 1:15-2:30 123 Feigenbaum yes
TTh 1:15-2:30 212 Gupta yes enroll in EE282
TTh 1:15-2:30 327C LaTombe yes
TTh 1:15-2:30 441 Luckham yes
TTh 1:15-2:30 429 Rosenbloom no same as Psych292
TTh 2:45-4:00 240B Staff yes
TTh 2:45-4:00 224 Jones yes
TTh 4:15-5:05 198H Smith/McGrory no
T 4:15-5:30 500 Staff yes
Th 4:15-5:05 548 Cheriton no MJH 352
TTh 7:00-7:50 196 Reges/Staff no consulting for micros
T 7:00-9:00 225B Jones no parallels 225A
TBA 001C Reges/Staff no
TBA 309C Haley no Industrial Lecturship
TBA 328C Pavel no same as Psych289A
by arrangement 001A Reges/Staff no dorm based
by arrangement 001D Reges/Staff no dorm based
by arrangement 191 Multiple Staff no
by arrangement 192 Reuling no
by arrangement 199 Multiple Staff no
by arrangement 199P Multiple Staff no
by arrangement 393 Multiple Staff no
by arrangement 399 Multiple Staff no
by arrangement 499 Multiple Staff no
by arrangement 801 Multiple Staff no
by arrangement 802 Multiple Staff no
-------
∂05-Apr-87 1011 aarons%cvaxa.sussex.ac.uk@Cs.Ucl.AC.UK AAAI workshop proposal
Received: from TUNNEL.CS.UCL.AC.UK by SAIL.STANFORD.EDU with TCP; 5 Apr 87 10:11:06 PDT
Received: from cvaxa.sussex.ac.uk by mv1.Cs.Ucl.AC.UK via Janet with NIFTP
id aa04767; 5 Apr 87 17:02 WET
From: Aaron Sloman <aarons%cvaxa.sussex.ac.uk@Cs.Ucl.AC.UK>
Date: Sun, 5 Apr 87 17:59:13 GMT
Message-Id: <18499.8704051759@tsuna.cvaxa.sussex.ac.uk>
To: phayes <@Cs.Ucl.AC.UK:phayes@sri-kl.arpa>, woods@g.bbn.com,
rjb <@att.arpa:rjb@allegra>, jmc@sail.stanford.edu
Subject: AAAI workshop proposal
Hi Pat, Bill, Ron, John,
Since you are all listed in the AAAI87 Conference brochure I thought
I'd send you a copy of this message to Joseph Katz suggesting a
workshop on Philosophical foundations. I'd be interested to know what
you think of the idea and whether any of you would wish to join in.
Best wishes,
Aaron
PS, Pat
Alas I shall not be at AISB so won't be able to see you there.
>From Aaron Sloman Sun Apr 5 17:29:40 GMT 1987
To: katz%mitre.arpa@uk.ac.ucl.cs
Subject: AAAI Workshop on Philosophical Foundations of AI
Hi,
I've just noticed your invitation to submit workshop proposals for
AAAI.
I am not sure what the required format is, but if you thought it
appropriate I would be willing to lead a workshop on philosophical
foundations of computing and AI, if that is an acceptable field.
I would like to address questions about the sense in which machines
themselves can use symbols which THEY understand, have goals which
THEY want to achieve, etc. as opposed to merely being tools for human
beings. There are also many other philosophical issues worth raising
which, I believe, have not yet been addressed adequately by either
philosophical proponents or opponents of AI, including questions about
the nature of representations in connectionist models.
I've discussed some of these issues in various publications, e.g.
The computer revolution in philosophy,
Harvester Press and Humanities Press, 1978 (now out of print)
'Why robots will have emotions' (With Monica Croucher)
in IJCAI 1981
'What enables a machine to understand'
in IJCAI 1985
'Reference without causal links'
in ECAI (European Conference on AI) in 1986
and a book I am writing on philosophical foundations of computing
and AI.
I also led a panel on meaning at IJCAI-83, with Bill Woods, Pat Hayes,
Drew McDermott.
If you wish to consult others as to my suitability for this purpose
several members of the AAAI committee and the conference committee
know or know of me, some well and some not so well, including Woody
Bledsoe, John McCarthy, Pat Hayes, Nils Nilsson, Ron Brachman, John
Seely Brown, Bill Woods, Bonnie Webber, Jerry de Jong, and several
others.
I don't know which of them would be willing to comment. The ones I
have talked to most about these issues are John McCarthy, Pat Hayes,
Ron Brachman and especially Bill Woods.
Please could you let me know whether this message gets to you. ARPA
mail is very uncertain from here. Also let me know if you would like
me to send copies of the above papers.
When would you expect to take a decision? If you accept this proposal
I'll need time to apply for travel funds.
I look forward to hearing from you.
Yours sincerely,
Aaron Sloman
School of Cognitive Sciences,
University of Sussex,
Brighton, BN1 9QN, England
phone: 044 (273) 678294 (University)
044 (273) 506532 (Home).
Email:
UUCP: ...mcvax!ukc!cvaxa!aarons
ARPANET : aarons%uk.ac.sussex.cvaxa@cs.ucl.ac.uk
or aarons@cvaxa.sussex.ac.uk
∂06-Apr-87 0951 guibas@navajo.stanford.edu meeting on foundations candidates, 4/7, 2:30 pm, MJH 146
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Apr 87 09:51:09 PDT
Received: by navajo.stanford.edu; Mon, 6 Apr 87 09:49:41 PST
Date: 6 Apr 1987 0949-PST (Monday)
From: Leonidas Guibas <guibas@navajo.stanford.edu>
To: faculty@score.stanford.edu
Cc: fndsch@navajo.stanford.edu
Subject: meeting on foundations candidates, 4/7, 2:30 pm, MJH 146
There will be a faculty meeting to discuss and vote on the
recommendations of the foundations search committee tomorrow, Tuesday,
April 7, at 2:30 pm in MJH 146. This is an important meeting affecting
a vital area of the department, so please plan on attending.
In the meantime, please stop by Phyllis Winkler' office (MJH 330) to
browse through the resumes and letters of the candidates to be
discussed. These are:
Joel Friedman of UC Berkeley
John Mitchell of ATT Bell Labs
Andrew Goldberg of MIT, and
Subhash Suri of Johns Hopkins.
LG
∂06-Apr-87 1339 binford@whitney.stanford.edu congratulations
Received: from WHITNEY.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Apr 87 13:38:55 PDT
Received: by whitney.stanford.edu; Mon, 6 Apr 87 13:41:11 PST
Date: Mon, 6 Apr 87 13:41:11 PST
From: Tom Binford <binford@whitney.stanford.edu>
To: jmc@sail.stanford.edu
Subject: congratulations
John
Congratulations on your chair.
I would have gone to the ceremony but I was out of
town at an ARPA workshop.
Best Regards
Tom
∂06-Apr-87 1546 @Score.Stanford.EDU:AIMAG@SUMEX-AIM.STANFORD.EDU Party for Bob Engelmore
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Apr 87 15:46:47 PDT
Received: from SUMEX-AIM.STANFORD.EDU by SCORE.STANFORD.EDU with TCP; Mon 6 Apr 87 15:44:18-PDT
Date: Mon 6 Apr 87 15:45:35-PDT
From: Mike Hamilton, AI Magazine <AIMAG@SUMEX-AIM.STANFORD.EDU>
Subject: Party for Bob Engelmore
To: mccarthy@SCORE.STANFORD.EDU
Telephone: (415) 328-3123 or (415) 853-0197
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Message-ID: <12292442900.94.AIMAG@SUMEX-AIM.STANFORD.EDU>
The Fall 1987 issue of AI Magazine marks the twenty-fifth issue under
Bob Engelmore's editorship. Claudia and I thought it would be nice to
commemorate this event with a surprise dinner for Bob (perhaps at
AAAI-87 in Seattle) and a short lampoon 25th issue (for private
distribution, of course!) of about 16 pages, with short, hopefully
humourous paragraphs and/or anecdotes. The publication could be done
quite inexpensively, and I think we could have some fun with it.
We would like to know if you have any thoughts, ideas, or suggestions
along this line; perhaps even a contribution to the publication!
Thanks for your help.
--Mike Hamilton
-------
∂06-Apr-87 1608 AIMAG@SUMEX-AIM.STANFORD.EDU Party for Bob Engelmore
Received: from SUMEX-AIM.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Apr 87 16:08:15 PDT
Date: Mon 6 Apr 87 15:57:48-PDT
From: Mike Hamilton, AI Magazine <AIMAG@SUMEX-AIM.STANFORD.EDU>
Subject: Party for Bob Engelmore
To: jmc@SAIL.STANFORD.EDU
Telephone: (415) 328-3123 or (415) 853-0197
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Message-ID: <12292445125.94.AIMAG@SUMEX-AIM.STANFORD.EDU>
The Fall 1987 issue of AI Magazine marks the twenty-fifth issue under
Bob Engelmore's editorship. Claudia and I thought it would be nice to
commemorate this event with a surprise dinner for Bob (perhaps at
AAAI-87 in Seattle) and a short lampoon 25th issue (for private
distribution, of course!) of about 16 pages, with short, hopefully
humourous paragraphs and/or anecdotes. The publication could be done
quite inexpensively, and I think we could have some fun with it.
We would like to know if you have any thoughts, ideas, or suggestions
along this line; perhaps even a contribution to the publication!
Thanks for your help.
--Mike Hamilton
-------
∂06-Apr-87 1737 TEICH@Sushi.Stanford.EDU EES285 as an elective
Received: from SUSHI.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 6 Apr 87 17:37:09 PDT
Date: Mon 6 Apr 87 17:33:24-PDT
From: David Teich <TEICH@Sushi.Stanford.EDU>
Subject: EES285 as an elective
To: jmc@Sail.Stanford.EDU
cc: jutta@Score.Stanford.EDU,
: ;
Message-ID: <12292462528.14.TEICH@Sushi.Stanford.EDU>
Would you be willing to sign for EES285, "Intelligent Management Systems,"
as an elective for my degree program. It would replace one of the electives
listed as options for Symbolic and Heuristic Computation majors.
The course is a new project course taught by Prof. Edison Tse. We will
be analyzing and designing a knowledge system for managers, to aid in
decisions to place companies in a competitive market strategy.
I'm not positive I can fit it into my schedule, but if I can I feel it
will directly involve me in my area of interest. I am interested in seeing
how AI can be used to aid business decisions.
If you agree with me, and I can fit the course into my schedule, I will
get my degree plan check sheet from Jutta and bring it to you for your
signature.
thank you,
david
-------
∂07-Apr-87 1503 perlis@yoohoo.cs.umd.edu help
Received: from MIMSY.UMD.EDU by SAIL.STANFORD.EDU with TCP; 7 Apr 87 15:03:10 PDT
Received: from by mimsy.umd.edu (5.54/4.7)
id AA17121; Tue, 7 Apr 87 18:00:48 EST
Received: by yoohoo.cs.umd.edu (1.1/3.14)
id AA00760; Tue, 7 Apr 87 17:03:17 EST
Date: Tue, 7 Apr 87 17:03:17 EST
From: perlis@yoohoo.cs.umd.edu
Return-Path: <perlis@yoohoo.cs.umd.edu>
Message-Id: <8704072203.AA00760@yoohoo.cs.umd.edu>
To: ether.allegra%btl.csnet@relay.cs.net, grosof@sumex-aim,
jmc@sail.stanford.edu, jmc@su-ai, reiter%utai.toronto.edu@relay.cs.net,
val@sail.stanford.edu
Subject: help
Cc: perlis@mimsy.umd.edu
I am updating my bibliography of non-monotonic reasoning literature, for
inclusion in a forthcoming volume on that topic. I include its current
status below. Please suggest any favorite papers that I may have left out,
whether your own or those of others. Thanks!
P.S. I would like to send this to the Editor in a few days, so a prompt
response would be appreciated.
--Don Perlis
(1) K. Apt, H. Blair, and A. Walker. Towards a theory of
declarative knowledge. In Proceedings of the 1986
Workshop on Foundations of deductive Databases and
Logic Programming, 1986.
(2) Besnard, Ph., Quiniou, R., and Quinton, P. [1983] A
theorem-prover for a decidable subset of default logic.
Proc. AAAI-83, pp. 27-30.
(3) D. G. Bobrow and P. J. Hayes, Artificial intelligence
- where are we? Artificial Intelligence, 24:375-415,
1985.
(4) G. Bossu and P. Siegel. Saturation, nonmonotonic rea-
soning and the closed-world assumption. Artificial
Intelligence, 25:13-63, 1985.
(5) R. J. Brachman. I lied about the trees or, defaults
and definitions in knowledge representation. AI Maga-
zine, 6(3):80-93, 1985.
(6) Clark, K. [1978] Negation as failure. In: Logic and
Databases, Gallaire, H. and Minker, J. (eds.). Plenum
Press, New York, pp. 293-322.
(7) Davis, M. [1980] The mathematics of non-monotonic rea-
soning. Artificial Intelligence, 13 (1,2), pp. 73-80.
(8) Dempster, A. [1967] Upper and lower probabilities
induced by a multivalued mapping. Ann. Math. Statis-
tics, 38, pp. 325-339.
(9) Doyle, J. [1977] Truth maintenance systems for problem
solving. Proc. 5th IJCAI, p. 247.
(10) Doyle, J. [1979] A glimpse of truth maintenance. Proc.
6th IJCAI, pp. 232-237.
(11) Doyle, J. [1979] A truth maintenance system. Artificial
Intelligence, 12. 231-272.
(12) Doyle, J. [1983] The ins and outs of reason mainte-
nance. Proc. 8th IJCAI, pp. 349-351.
(13) Doyle, J. [1984] Circumscription and implicit defina-
bility. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pages 57-69, American Association for Artifi-
cial Intelligence, New Paltz, NY.
(14) Doyle, J. [1985] Reasoned assumptions and Pareto
optimality. In Proceedings of the Ninth International
Joint Conference on Artificial Intelligence, pages 87-
90.
(15) Doyle, J. [1982]. Some Theories of Reasoned Assump-
tions: An Essay in Rational Psychology. Technical
Report, Department of Computer Science, Carnegie- Mel-
lon University.
(16) Etherington, D. [1982] Finite default theories. MSc
Thesis, University of British Columbia.
(17) Etherington, D. and Reiter, R. [1983] On inheritance
hierarchies with exceptions. Proc. AAAI-83, pp. 104-
108.
(18) D. W. Etherington. Formalizing nonmonotonic reasoning
systems. Artificial Intelligence, 31:41-85, 1987.
(19) D. W. Etherington. Reasoning with Incomplete Informa-
tion: Investigations of Non-Monotonic Reasoning. PhD
thesis, University of British Columbia, Vancouver,
Canada, 1986.
(20) Etherington, D.W., Mercer, R. E., and Reiter, R. [1985]
On the adequacy of predicate circumscription for
closed-world reasoning. Comp. Intelligence, 1:11-15.
(21) S. E. Fahlman. NETL: A System for Representing and
Using Real-World Knowledge. MIT Press, Cambridge, MA,
1979.
(22) Fahlman, S., Touretzky, D., and Van Roggen, W. [1981]
Cancellation in a parallel semantic network. Proc. 7th
IJCAI, pp. 257-263.
(23) R. Fikes an N. J. Nilsson. STRIPS: a new approach to
the application of theorem proving to problem solving.
Artificial Intelligence, 2:189-208, 1971.
(24) J. J. Finger. Exploiting Constraints in Design Syn-
thesis. PhD thesis, Stanford University, Stanford, CA,
1987.
(25) Gabbay, D. [1982] Intuitionistic basis for non-
monotonic logic. Lecture Notes in Computer Science,
Vol. 139, Springer.
(26) M. Gelfond. On Stratified Autoepistemic Theories.
Technical Report, University of Texas at El Paso, 1986.
(27) M. Gelfond and H. Przymusinska. Negation as failure:
Careful closure procedure. Artificial Intelligence,
1987.
(28) M. Gelfond and H. Przymusinska. On the Relationship
between Autoepistemic Logic and Parallel Circumscrip-
tion. Technical Report, University of Texas at El
Paso, 1986.
(29) M. Gelfond, H. Przymusinska, and T. Przymusinski. The
extended closed world assumption and its relationship
to parallel circumscription. In Proceedings of ACM
SIGACT-SIGMOD Symposium on Principles of Database Sys-
tems, pages 133-139, 1986.
(30) M. R. Genesereth. An overview of meta-level architec-
ture. In Proceedings of the Third National Conference
on Artificial Intelligence, pages 119- 124, 1983.
(31) M. R. Genesereth. The use of design descriptions in
automated diagnosis. Artificial Intelligence, 24:411-
436, 1985.
(32) M. R. Genesereth and M. L. Ginsberg. Logic program-
ming. Commun. ACM, 28:933-941, 1985.
(33) M. R. Genesereth and N. J. Nilsson. Logical Founda-
tions of Artificial Intelligence, Morgan Kaufmann,
1987.
(34) M. P. Georgeff. Many agents are better than one. In
Proceedings of the 1987 Workshop on Logical Solutions
to the Frame Problem, Lawrence, Kansas, 1987.
(35) M. L. Ginsberg. Counterfactuals. Artificial Intelli-
gence, 30:35-80, 1986.
(36) M. L. Ginsberg. Does probability have a place in non-
monotonic reasoning? In Proceedings of the Ninth
International Joint Conference on Artificial Intelli-
gence, pages 107-110, 1985.
(37) M. L. Ginsberg. Multi-valued Inference. Technical
Report 86-73, KSL, Stanford University, 1986.
(38) M. L. Ginsberg. Multi-valued Logics. Technical Report
86-29, KSL, Stanford University, 1986.
(39) M. L. Ginsberg. Multi-valued logics. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pages 243-247, 1986.
(40) M. L. Ginsberg. Non-monotonic reasoning using
Dempster's rule. In Proceedings of the Fourth National
Conference on Artificial Intelligence, pages 126-129,
1984.
(41) M. L. Ginsberg. Steps toward a general-purpose infer-
ence engine. In Proceedings of the Sixth National
Conference on Artificial Intelligence, 1987.
(42) M. L. Ginsberg and D. E. Smith. Reasoning about action
I: A possible worlds approach. In Proceedings of the
1987 Workshop on Logical Solutions to the Frame Prob-
lem, Lawrence, Kansas, 1987.
(43) M. L. Ginsberg and D. E. Smith. Reasoning about action
II: The qualification problem. In Proceedings of the
1987 Workshop on Logical Solutions to the Frame
Problem, Lawrence, Kansas, 1987.
(44) Grant, J. and Minker, J. [1984] Answering queries in
indefinite databases and the null value problem. Tech.
Report 1374, University of Maryland.
(45) B. N. Grosof. Non-monotonicity in probabilistic rea-
soning. In Proceedings 1986 Workshop on Uncertainty in
Artificial Intelligence, pages 91-98, Philadelphia, PA,
1986.
(46) Grosof, B. Default Reasoning as Circumscription,
Workshop on Nonmonotonic Reasoning, New Paltz, NY,
sponsored by AAAI, Oct. 17-19, 1984.
(47) Haas, A. [1981] Reasoning about deduction with unknown
constants. Proc. 7th IJCAI, pp. 382-384.
(48) J. Y. Halpern and Y. Moses. Towards a theory of
knowledge and ignorance. In Proceedings 1984 Non-
monotonic Reasoning Workshop, pages 165-193, American
Association for Artificial Intelligence, New Paltz, NY,
1984.
(49) S. Hanks and D. McDermott. Default reasning, nonmono-
tonic logics and the frame problem. In Proceedings of
the Fifth National Conference on Artificial Intelli-
gence, pages 328-333, 1986.
(50) Israel, D. [1980] What's wrong with non-monotonic
logic? Proc. AAAI-80, pp. 99-101.
(51) D. J. Israel. What's wrong with non-monotonic logic?
In Proceedings of the First National Conference on
Artificial Intelligence, pages 99-101, 1980.
(52) H. A. Kautz. The logic of persistence. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pages 401-405, 1986.
(53) J. de Kleer. An assumption-based truth maintenance
system. Artificial Intelligence, 28:127-162, 1986.
(54) J. de Kleer. Choices without backtracking. In
Proceedings of the Fourth National Conference on Artif-
icial Intelligence, pages 79-85, 1984.
(55) J. de Kleer. Extending the ATMS. Artificial Intelli-
gence, 28:163-196, 1986.
(56) J. de Kleer. Problem solving with the ATMS. Artifi-
cial Intelligence, 28:197-224, 1986.
(57) J. de Kleer and B. C. Williams. Diagnosing multiple
faults. Artificial Intelligence, 31, 1987.
(58) Konolige, K. [1982] Circumscriptive ignorance. Proc.
AAAI-82, pp. 202-204.
(59) Konolige, K. [1984] Belief and incompleteness. SRI
Tech. Note 319.
(60) K. Konolige. On the relation between default theories
and autoepistemic logic. In M. L. Ginsberg, editor,
Readings in Non-Monotonic Reasoning, Morgan Kaufmann,
Los Altos, CA, 1987.
(61) K. Konolige and K. L. Myers. Representing defaults
with epistemic concepts. In Proceedings of the Sixth
National Conference on Artificial Intelligence, 1987.
(62) Kowalski, R. [1978] Logic for data description. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.). Plenum Press, New York, pp. 77-103.
(63) Kowalski, R. [1979] Logic for Problem Solving. North-
Holland, New York.
(64) R. Kowalski and M. Sergot. A logic-based calculus of
events. New Generation Computing, 4:67-95, 1986.
(65) I. Kramosil. A note on deduction rules with negative
premises. In Proceedings of the Fourth International
Joint Conference on Artificial Intelligence, pages 53-
56, 1975.
(66) Kramosil, I. [1975] A note on deduction rules with
negative premises. Proc. 4th IJCAI, pp. 53-56.
(67) Kueker, D. Another Failure of Completeness for Cir-
cumscription, Week on Logic and Artificial Intelli-
gence, Univ. of Maryland, Oct. 22-26, 1984.
(68) Levesque, H. [1981] Incompleteness in knowledge bases.
SIGART Newsletter 74, p. 150ff.
(69) Levesque, H. [1981] The interaction with incomplete
knowledge bases: a formal treatment. Proc. 7th IJCAI,
pp. 240-245.
(70) Levesque, H.J. [1982] A formal treatment of incomplete
knowledge. Fairchild Lab for AI Research, Tech. Report
3.
(71) Lifschitz, V. [1984] Some Results on Circumscription,
Workshop on Nonmonotonic Reasoning, New Paltz, NY,
sponsored by AAAI, Oct. 17-19, 1984.
(72) V. Lifschitz. Closed-world databases and circumscrip-
tion. Artificial Intelligence, 27:229-235, 1985.
(73) V. Lifschitz. Computing circumscription. In Proceed-
ings of the Ninth International Joint Conference on
Artificial Intelligence, pages 121-127, 1985.
(74) V. Lifschitz. On the declarative semantics of logic
programs with negation. In Proceedings of the 1986
Workshop on Foundations of Deductive Databases and
Logic Programming, 1986.
(75) V. Lifschitz. On the satisfiability of circumscrip-
tion. Artificial Intelligence, 28:17-27, 1986.
(76) V. Lifschitz. Pointwise circumscription. In M. L.
Ginsberg, editor, Readings in Non-Monotonic Reasoning,
Morgan Kaufmann, Los Altos, CA, 1987.
(77) V. Lifschitz. Pointwise circumscription: preliminary
report. In Proceedings of the Fifth National Confer-
ence on Artificial Intelligence, pages 406-410, 1986.
(78) Lipski, W. [1977] On the logic of incomplete informa-
tion. Lecture Notes in Computer Science, v.53,
Springer, pp. 374-381. (6th Symposium on Mathematical
Foundations of Computer Science)
(79) V. Lukaszewicz. Considerations on default logic. In
Proceedings 1984 Non-monotonic Reasoning Workshop,
pages 165-193, American Association for Artificial
Intelligence, New Paltz, NY, 1984.
(80) Lukaszewicz, W. [1983] General approach to nonmonotonic
logics. Proc. 8th IJCAI, pp. 352-354.
(81) J. P. Martins and S. C. Shapiro. A model for belief
revision. In Proceedings 1984 Non-monotonic Reasoning
Workshop, pages 241-294, American Association for
Artificial Intelligence, New Paltz, NY, 1984.
(82) J. P. Martins and S. C. Shapiro. Reasoning in multiple
belief spaces. In Proceedings of the Eigth Interna-
tional Joint Conference on Artificial Intelligence,
pages 370-373, 1983.
(83) McCarthy, J. [1980] Circumscription--a form of non-
monotonic reasoning. Artificial Intelligence, 13 (1,2),
pp. 27-39.
(84) McCarthy, J. [1980] Addendum: circumscription and other
non-monotonic formalisms. Artificial Intelligence, 13
(1,2), pp. 171-172.
(85) McCarthy, J. [1984] Applications of Circumscription to
Formalizing Common Sense Knowledge, Workshop on Non-
monotonic Reasoning, New Paltz, NY, sponsored by AAAI,
Oct. 17-19, 1984.
(86) J. McCarthy. Applictions of circumscription to formal-
izing common sense knowledge. Artificial Intelligence,
28:89-116, 1986.
(87) J. McCarthy. Circumscription - a form of non-monotonic
reasoning. Artificial intelligence, 13:27-39, 1980.
(88) J. McCarthy. Epistemological problems of artificial
intelligence. In Proceedings of the Fifth Interna-
tional Joint Conference on Artificial Intelligence,
pages 1038-1044, Cambridge, MA, 1977.
(89) McCarthy, J. and Hayes, P. [1969] Some philosophical
problems from the standpoint of artificial intelli-
gence. In Machine Intelligence 4, Meltzer, B. and
Michie, D. (eds.), Edinburgh University Press.
(90) McDermott, D. [1982] Non-monotonic logic II: non-
monotonic modal theories. Journal of the ACM, 29 (1),
pp. 33-57.
(91) McDermott, D. and Doyle, J. [1980] Non-monotonic logic
I. Artificial Intelligence, 13 (1,2), pp. 41-72.
(92) D. McDermott. AI, logic, and the frame problem. In
Proceedings of the 1987 Workshop on Logical Solutions
to the Frame Problem, Lawrence, Kansas, 1987.
(93) D. McDermott. A critique of pure reason. To appear.
(94) Mercer, R. and Rosenberg, R.S. [1984] Generating
corrective answers by computing presuppositions of
answers, not questions, or Mind your P's, not Q's. Proc
CSCSI-84, pp16-18.
(95) J. Minker and D. Perlis. Protected circumscription.
In Proceedings 1984 Non-monotonic Reasoning Workshop,
pages 337-343, American Association for Artificial
Intelligence, New Paltz, NY, 1984.
(96) Minker, J. [1982] On indefinite databases and the
closed-world assumption. Lecture Notes in Computer Sci-
ence, v. 138, pp. 292-308, Springer. (6th Conference on
Automated Deduction).
(97) Minker, J. and Perlis, D. [1984b] Applications of pro-
tected circumscription. Lecture Notes in Computer
Science, v. 170, pp. 414-425, Springer. (7th Conference
on Automated Deduction).
(98) M. Minsky. A framework for representing knowledge. In
P. Winston, editor, The Psychology of Computer Vision,
pages 211-277, McGraw-Hill, 1975.
(99) R. Moore. Semantical considerations on nonmonotonic
logic. Artificial Intelligence, 25:75-94, 1985.
(100)
Moore, R. [1975] Reasoning from incomplete knowledge in
a procedural deduction system. MIT AI Lab Memo 347.
(101)
Moore, R. [1983] Semantical considerations on non-
monotonic logic. Proc. 8th IJCAI, pp. 272-279.
(102)
J. Nutter. Default reasoning using monotonic logic: A
modest proposal. In Proceedings of the Third National
Conference on Artificial Intelligence, pages 297-300,
1983.
(103)
Nutter, J. [1983] Default reasoning in AI systems. MSc
Thesis, SUNY at Buffalo, Computer Science Tech. Report
204.
(104)
Nutter, J. [1983] What else is wrong with nonmonotonic
logics? Representational and informational shortcom-
ings. Proc. 5th Cognitive Science Conference, Roches-
ter.
(105)
Papalaskaris, M. A. and Bundy, A. [1984] Topics for
Circumscription. Workshop on Nonmonotonic Reasoning,
New Paltz, NY, sponsored by AAAI, Oct. 17-19, 1984.
(106)
Pena, L. [1980] The philosophical relevance of a con-
tradictorial system of logic. Proc. 10th Int'l Sympo-
sium on Multiple-valued Logic, pp. 238-252.
(107)
D. Perlis. Bibliography of literature on non-monotonic
reasoning. In Proceedings 1984 Non-monotonic Reasoning
Workshop, pages 396-401, American Association for
Artificial Intelligence, New Paltz, NY, 1984.
(108)
D. Perlis. On the consistency of commonsense reason-
ing. Computational Intelligence, 1987, pp??
(109)
Perlis, D. [1984] Non-monotonicity and real-time rea-
soning. Workshop on Nonmonotonic Reasoning, New Paltz,
NY, sponsored by AAAI, Oct. 17-19, 1984.
(110)
Perlis, D. [1987] Circumscribing with sets. Artificial
Intelligence.??
(111)
Perlis, D. [1987] Auto-circumscription. Draft??
(112)
D. Perlis and J. Minker. Completeness results for cir-
cumscription. Artificial Intelligence, 28:29-42, 1986.
(113)
R. Perrault. An Application of Default Logic to Speech
Act Theory. Technical Report, SRI International, 1987.
(114)
T. C. Przymusinski. Query-answering in circumscriptive
and closed-world theories. In Proceedings of the Fifth
National Conference on Artificial Intelligence, pages
186-190, 1986.
(115)
R. Reiter. Nonmonotonic reasoning. Annual Reviews of
Computer Science, 1987.
(116)
R. Reiter. On closed world data bases. In H. Gallaire
and J. Minker, editors, Logic and Data Bases, pages
119-140, Plenum, New York, 1978.
(117)
R. Reiter. A Theory of Diagnosis from First Princi-
ples. Technical Report 187/86, Computer Science
Department, University of Toronto, 1985.
(118)
Reiter, R. [1978] On closed world databases. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.), Plenum, pp. 55-76.
(119)
Reiter, R. [1978] On reasoning by default. Proc
TINLAP-2, Urbanna, Ill.
(120)
Reiter, R. [1980] Equality and domain closure
in first-order databases. Journal of the ACM 27
(2), pp. 235-249.
(121)
Reiter, R. [1980] A logic for default reasoning, Artif-
icial Intelligence 13 (1,2), pp. 81-132.
(122)
Reiter, R. [1982] circumscription implies predi-
cate completion (sometimes). Proc. AAAI-82, pp.
418-420.
(123)
R. Reiter and G. Criscuolo. On interacting defaults.
In Proceedings of the Seventh International Joint
Conference on Artificial Intelligence, pages 270-276,
1981.
(124)
Reiter, R. and Criscuolo, G. [1983] Some representa-
tional issues in default reasoning. Int. J. Computers
and Mathematics (special issue on computational
linguistics).
(125)
Rescher, N. [1976] Plausible Inference. Van Gorcum,
Assen, The Netherlands.(126)
E. Rich. Default reasoning as likelihood reasoning.
In Proceedings of the Third National Conference on
Artificial Intelligence, pages 348-351, 1983.
(127)
S. Russell. The Compleat Guide to MRS. Technical
Report STAN-CS-85-1080, Stanford University, June 1985.
(128)
Sandewall, E. [1972] An approach to the frame problem
and its implementation. Machine Intelligence 7.
(129)
Sandewall, E. [1983] Partial models, attribute propoga-
tion systems, and non-monotonic semantics. Linkoping
University. LITH-IDA-R-83-01.
(130)
Shafer, G. [1976] A Mathematical Theory of Evidence.
Princeton Univ. Press.
(131)
J. C. Shepherdson. Negation as failure: A comparison
of Clark's completed data base and Reiter's closed
world assumption. J. Logic Programming, 1:51-79, 1984.
(132)
J. C. Shepherdson. Negation as failure II. J. Logic
Programming, 3:185- 202, 1985.
(133)
Y. Shoham. Chronological ignorance. In Proceedings of
the Fifth National Conference on Artificial Intelli-
gence, pages 389-393, 1986.
(134)
Y. Shoham. Non-monotonic logics. In M. L. Ginsberg,
editor, Readings in Non_Monotonic Reasoning, Morgan
Kaufmann, Los Altos, CA, 1987.
(135)
E. H. Shortliffe. Computer-based Medical Consulta-
tions: MYCIN, American Elsevier, New York, 1976.
(136)
Stalnaker, R. [1980] A note on non-monotonic modal
logic. Dept. of Philosophy, Cornell University.
(137)
Touretzky, D. [1984] The mathematics of inheritance
systems. Ph.D. Thesis, Carnegie-Mellon University.
(138)
D. S. Touretzky. Implicit ordering of defaults in
inheritance systems. In Proceedings of the Fifth
National Conference on Artificial Intelligence, pages
322-325, 1984.
(139)
Vere, S. [1980] Multi-level counterfactuals for gen-
eralizations of relational concepts and productions.
Artificial Intelligence, 14 (2), pp. 139-164.
(140)
A. Van Gelder. Negation as failure using tight deriva-
tions for general logic programs. In Proceedings of
the 1986 Workshop on Foundations of Deductive Databases
and Logic Programming, 1986.
(141)
Weyhrauch, R. [1980] Prolegomena to a theory of mechan-
ized formal reasoning Artificial Intelligence, 13
(1,2), pp. 133-170.
(142)
Winograd, T. [1980] Extended inference modes in reason-
ing by computer systems. Artificial Intelligence 13
(1,2), pp. 5-26.
(143)
A. Yahya and L. J. Henschen. Deduction in non-Horn
databases. Journal of Automated Reasoning, 1:141-160,
1985.
(144)
Non-Monotonic Reasoning Workshop, New Paltz, NY, 1984.
(145)
Workshop on Logical Solutions to the Frame Problem,
Morgan Kaufmann, Lawrence, KS, 1987.
(146)
Workshop on Uncertainty and Probability in Artificial
Intelligence, UCLA, Los Angeles, California, 1985.
(147)
Workshop on Uncertainty in Artificial Intelligence,
University of Pennsylvania, Philadelphia, PA, 1986.
~h
∂07-Apr-87 1726 PAPA@score.stanford.edu Friedman
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Apr 87 17:26:42 PDT
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Tue, 7 Apr 87 17:25:30 PST
Date: Tue 7 Apr 87 17:21:28-PDT
From: C. Papadimitriou <PAPA@score.stanford.edu>
Subject: Friedman
To: fndsch@navajo.stanford.edu
Message-Id: <12292722500.20.PAPA@Score.Stanford.EDU>
Peter Sarnak knocked on my door to discuss Friedman. He feels that we have
a good chance to get him. One new piece of information was that it would
not be automatic, or easy, to have Math offer Joel a half tenure-track
position, even if the Deans threw in one. This would go against tradition
and recently establish policy. However, they would be prepared to consider
him in three years fro a second-term Assistant Professor. This makes this
look like an exercise in titles and names, but maybe Gibbons does not feel
this way.
Sarnak wants one of us to meet with his Chairman tomorrow at 1:30. Leo, can
you make it? Also, some of us to be involved in Joel's visit Thursday.
---Christos.
-------
∂07-Apr-87 1740 perlis@yoohoo.cs.umd.edu repeat message
Received: from MIMSY.UMD.EDU by SAIL.STANFORD.EDU with TCP; 7 Apr 87 17:39:36 PDT
Received: from by mimsy.umd.edu (5.54/4.7)
id AA21863; Tue, 7 Apr 87 20:39:12 EST
Received: by yoohoo.cs.umd.edu (1.1/3.14)
id AA01070; Tue, 7 Apr 87 19:41:44 EST
Date: Tue, 7 Apr 87 19:41:44 EST
From: perlis@yoohoo.cs.umd.edu
Return-Path: <perlis@yoohoo.cs.umd.edu>
Message-Id: <8704080041.AA01070@yoohoo.cs.umd.edu>
To: ether.allegra%btl.csnet@relay.cs.net, grosof@sail.stanford.edu,
jmc@sail.stanford.edu, reiter%utai.toronto.edu@relay.cs.net,
val@sail.stanford.edu
Subject: repeat message
Cc: perlis@mimsy.umd.edu
There was a mailer error reported in my previous attempt to send this,
so you may or may not get two copies...
I am updating my bibliography of non-monotonic reasoning literature, for
inclusion in a forthcoming volume on that topic. I include its current
status below. Please suggest any favorite papers that I may have left out,
whether your own or those of others. Thanks!
P.S. I would like to send this to the Editor in a few days, so a prompt
response would be appreciated.
--Don Perlis
(1) K. Apt, H. Blair, and A. Walker. Towards a theory of
declarative knowledge. In Proceedings of the 1986
Workshop on Foundations of deductive Databases and
Logic Programming, 1986.
(2) Besnard, Ph., Quiniou, R., and Quinton, P. [1983] A
theorem-prover for a decidable subset of default logic.
Proc. AAAI-83, pp. 27-30.
(3) D. G. Bobrow and P. J. Hayes, Artificial intelligence
- where are we? Artificial Intelligence, 24:375-415,
1985.
(4) G. Bossu and P. Siegel. Saturation, nonmonotonic rea-
soning and the closed-world assumption. Artificial
Intelligence, 25:13-63, 1985.
(5) R. J. Brachman. I lied about the trees or, defaults
and definitions in knowledge representation. AI Maga-
zine, 6(3):80-93, 1985.
(6) Clark, K. [1978] Negation as failure. In: Logic and
Databases, Gallaire, H. and Minker, J. (eds.). Plenum
Press, New York, pp. 293-322.
(7) Davis, M. [1980] The mathematics of non-monotonic rea-
soning. Artificial Intelligence, 13 (1,2), pp. 73-80.
(8) Dempster, A. [1967] Upper and lower probabilities
induced by a multivalued mapping. Ann. Math. Statis-
tics, 38, pp. 325-339.
(9) Doyle, J. [1977] Truth maintenance systems for problem
solving. Proc. 5th IJCAI, p. 247.
(10) Doyle, J. [1979] A glimpse of truth maintenance. Proc.
6th IJCAI, pp. 232-237.
(11) Doyle, J. [1979] A truth maintenance system. Artificial
Intelligence, 12. 231-272.
(12) Doyle, J. [1983] The ins and outs of reason mainte-
nance. Proc. 8th IJCAI, pp. 349-351.
(13) Doyle, J. [1984] Circumscription and implicit defina-
bility. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pages 57-69, American Association for Artifi-
cial Intelligence, New Paltz, NY.
(14) Doyle, J. [1985] Reasoned assumptions and Pareto
optimality. In Proceedings of the Ninth International
Joint Conference on Artificial Intelligence, pages 87-
90.
(15) Doyle, J. [1982]. Some Theories of Reasoned Assump-
tions: An Essay in Rational Psychology. Technical
Report, Department of Computer Science, Carnegie- Mel-
lon University.
(16) Etherington, D. [1982] Finite default theories. MSc
Thesis, University of British Columbia.
(17) Etherington, D. and Reiter, R. [1983] On inheritance
hierarchies with exceptions. Proc. AAAI-83, pp. 104-
108.
(18) D. W. Etherington. Formalizing nonmonotonic reasoning
systems. Artificial Intelligence, 31:41-85, 1987.
(19) D. W. Etherington. Reasoning with Incomplete Informa-
tion: Investigations of Non-Monotonic Reasoning. PhD
thesis, University of British Columbia, Vancouver,
Canada, 1986.
(20) Etherington, D.W., Mercer, R. E., and Reiter, R. [1985]
On the adequacy of predicate circumscription for
closed-world reasoning. Comp. Intelligence, 1:11-15.
(21) S. E. Fahlman. NETL: A System for Representing and
Using Real-World Knowledge. MIT Press, Cambridge, MA,
1979.
(22) Fahlman, S., Touretzky, D., and Van Roggen, W. [1981]
Cancellation in a parallel semantic network. Proc. 7th
IJCAI, pp. 257-263.
(23) R. Fikes an N. J. Nilsson. STRIPS: a new approach to
the application of theorem proving to problem solving.
Artificial Intelligence, 2:189-208, 1971.
(24) J. J. Finger. Exploiting Constraints in Design Syn-
thesis. PhD thesis, Stanford University, Stanford, CA,
1987.
(25) Gabbay, D. [1982] Intuitionistic basis for non-
monotonic logic. Lecture Notes in Computer Science,
Vol. 139, Springer.
(26) M. Gelfond. On Stratified Autoepistemic Theories.
Technical Report, University of Texas at El Paso, 1986.
(27) M. Gelfond and H. Przymusinska. Negation as failure:
Careful closure procedure. Artificial Intelligence,
1987.
(28) M. Gelfond and H. Przymusinska. On the Relationship
between Autoepistemic Logic and Parallel Circumscrip-
tion. Technical Report, University of Texas at El
Paso, 1986.
(29) M. Gelfond, H. Przymusinska, and T. Przymusinski. The
extended closed world assumption and its relationship
to parallel circumscription. In Proceedings of ACM
SIGACT-SIGMOD Symposium on Principles of Database Sys-
tems, pages 133-139, 1986.
(30) M. R. Genesereth. An overview of meta-level architec-
ture. In Proceedings of the Third National Conference
on Artificial Intelligence, pages 119- 124, 1983.
(31) M. R. Genesereth. The use of design descriptions in
automated diagnosis. Artificial Intelligence, 24:411-
436, 1985.
(32) M. R. Genesereth and M. L. Ginsberg. Logic program-
ming. Commun. ACM, 28:933-941, 1985.
(33) M. R. Genesereth and N. J. Nilsson. Logical Founda-
tions of Artificial Intelligence, Morgan Kaufmann,
1987.
(34) M. P. Georgeff. Many agents are better than one. In
Proceedings of the 1987 Workshop on Logical Solutions
to the Frame Problem, Lawrence, Kansas, 1987.
(35) M. L. Ginsberg. Counterfactuals. Artificial Intelli-
gence, 30:35-80, 1986.
(36) M. L. Ginsberg. Does probability have a place in non-
monotonic reasoning? In Proceedings of the Ninth
International Joint Conference on Artificial Intelli-
gence, pages 107-110, 1985.
(37) M. L. Ginsberg. Multi-valued Inference. Technical
Report 86-73, KSL, Stanford University, 1986.
(38) M. L. Ginsberg. Multi-valued Logics. Technical Report
86-29, KSL, Stanford University, 1986.
(39) M. L. Ginsberg. Multi-valued logics. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pages 243-247, 1986.
(40) M. L. Ginsberg. Non-monotonic reasoning using
Dempster's rule. In Proceedings of the Fourth National
Conference on Artificial Intelligence, pages 126-129,
1984.
(41) M. L. Ginsberg. Steps toward a general-purpose infer-
ence engine. In Proceedings of the Sixth National
Conference on Artificial Intelligence, 1987.
(42) M. L. Ginsberg and D. E. Smith. Reasoning about action
I: A possible worlds approach. In Proceedings of the
1987 Workshop on Logical Solutions to the Frame Prob-
lem, Lawrence, Kansas, 1987.
(43) M. L. Ginsberg and D. E. Smith. Reasoning about action
II: The qualification problem. In Proceedings of the
1987 Workshop on Logical Solutions to the Frame
Problem, Lawrence, Kansas, 1987.
(44) Grant, J. and Minker, J. [1984] Answering queries in
indefinite databases and the null value problem. Tech.
Report 1374, University of Maryland.
(45) B. N. Grosof. Non-monotonicity in probabilistic rea-
soning. In Proceedings 1986 Workshop on Uncertainty in
Artificial Intelligence, pages 91-98, Philadelphia, PA,
1986.
(46) Grosof, B. Default Reasoning as Circumscription,
Workshop on Nonmonotonic Reasoning, New Paltz, NY,
sponsored by AAAI, Oct. 17-19, 1984.
(47) Haas, A. [1981] Reasoning about deduction with unknown
constants. Proc. 7th IJCAI, pp. 382-384.
(48) J. Y. Halpern and Y. Moses. Towards a theory of
knowledge and ignorance. In Proceedings 1984 Non-
monotonic Reasoning Workshop, pages 165-193, American
Association for Artificial Intelligence, New Paltz, NY,
1984.
(49) S. Hanks and D. McDermott. Default reasning, nonmono-
tonic logics and the frame problem. In Proceedings of
the Fifth National Conference on Artificial Intelli-
gence, pages 328-333, 1986.
(50) Israel, D. [1980] What's wrong with non-monotonic
logic? Proc. AAAI-80, pp. 99-101.
(51) D. J. Israel. What's wrong with non-monotonic logic?
In Proceedings of the First National Conference on
Artificial Intelligence, pages 99-101, 1980.
(52) H. A. Kautz. The logic of persistence. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pages 401-405, 1986.
(53) J. de Kleer. An assumption-based truth maintenance
system. Artificial Intelligence, 28:127-162, 1986.
(54) J. de Kleer. Choices without backtracking. In
Proceedings of the Fourth National Conference on Artif-
icial Intelligence, pages 79-85, 1984.
(55) J. de Kleer. Extending the ATMS. Artificial Intelli-
gence, 28:163-196, 1986.
(56) J. de Kleer. Problem solving with the ATMS. Artifi-
cial Intelligence, 28:197-224, 1986.
(57) J. de Kleer and B. C. Williams. Diagnosing multiple
faults. Artificial Intelligence, 31, 1987.
(58) Konolige, K. [1982] Circumscriptive ignorance. Proc.
AAAI-82, pp. 202-204.
(59) Konolige, K. [1984] Belief and incompleteness. SRI
Tech. Note 319.
(60) K. Konolige. On the relation between default theories
and autoepistemic logic. In M. L. Ginsberg, editor,
Readings in Non-Monotonic Reasoning, Morgan Kaufmann,
Los Altos, CA, 1987.
(61) K. Konolige and K. L. Myers. Representing defaults
with epistemic concepts. In Proceedings of the Sixth
National Conference on Artificial Intelligence, 1987.
(62) Kowalski, R. [1978] Logic for data description. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.). Plenum Press, New York, pp. 77-103.
(63) Kowalski, R. [1979] Logic for Problem Solving. North-
Holland, New York.
(64) R. Kowalski and M. Sergot. A logic-based calculus of
events. New Generation Computing, 4:67-95, 1986.
(65) I. Kramosil. A note on deduction rules with negative
premises. In Proceedings of the Fourth International
Joint Conference on Artificial Intelligence, pages 53-
56, 1975.
(66) Kramosil, I. [1975] A note on deduction rules with
negative premises. Proc. 4th IJCAI, pp. 53-56.
(67) Kueker, D. Another Failure of Completeness for Cir-
cumscription, Week on Logic and Artificial Intelli-
gence, Univ. of Maryland, Oct. 22-26, 1984.
(68) Levesque, H. [1981] Incompleteness in knowledge bases.
SIGART Newsletter 74, p. 150ff.
(69) Levesque, H. [1981] The interaction with incomplete
knowledge bases: a formal treatment. Proc. 7th IJCAI,
pp. 240-245.
(70) Levesque, H.J. [1982] A formal treatment of incomplete
knowledge. Fairchild Lab for AI Research, Tech. Report
3.
(71) Lifschitz, V. [1984] Some Results on Circumscription,
Workshop on Nonmonotonic Reasoning, New Paltz, NY,
sponsored by AAAI, Oct. 17-19, 1984.
(72) V. Lifschitz. Closed-world databases and circumscrip-
tion. Artificial Intelligence, 27:229-235, 1985.
(73) V. Lifschitz. Computing circumscription. In Proceed-
ings of the Ninth International Joint Conference on
Artificial Intelligence, pages 121-127, 1985.
(74) V. Lifschitz. On the declarative semantics of logic
programs with negation. In Proceedings of the 1986
Workshop on Foundations of Deductive Databases and
Logic Programming, 1986.
(75) V. Lifschitz. On the satisfiability of circumscrip-
tion. Artificial Intelligence, 28:17-27, 1986.
(76) V. Lifschitz. Pointwise circumscription. In M. L.
Ginsberg, editor, Readings in Non-Monotonic Reasoning,
Morgan Kaufmann, Los Altos, CA, 1987.
(77) V. Lifschitz. Pointwise circumscription: preliminary
report. In Proceedings of the Fifth National Confer-
ence on Artificial Intelligence, pages 406-410, 1986.
(78) Lipski, W. [1977] On the logic of incomplete informa-
tion. Lecture Notes in Computer Science, v.53,
Springer, pp. 374-381. (6th Symposium on Mathematical
Foundations of Computer Science)
(79) V. Lukaszewicz. Considerations on default logic. In
Proceedings 1984 Non-monotonic Reasoning Workshop,
pages 165-193, American Association for Artificial
Intelligence, New Paltz, NY, 1984.
(80) Lukaszewicz, W. [1983] General approach to nonmonotonic
logics. Proc. 8th IJCAI, pp. 352-354.
(81) J. P. Martins and S. C. Shapiro. A model for belief
revision. In Proceedings 1984 Non-monotonic Reasoning
Workshop, pages 241-294, American Association for
Artificial Intelligence, New Paltz, NY, 1984.
(82) J. P. Martins and S. C. Shapiro. Reasoning in multiple
belief spaces. In Proceedings of the Eigth Interna-
tional Joint Conference on Artificial Intelligence,
pages 370-373, 1983.
(83) McCarthy, J. [1980] Circumscription--a form of non-
monotonic reasoning. Artificial Intelligence, 13 (1,2),
pp. 27-39.
(84) McCarthy, J. [1980] Addendum: circumscription and other
non-monotonic formalisms. Artificial Intelligence, 13
(1,2), pp. 171-172.
(85) McCarthy, J. [1984] Applications of Circumscription to
Formalizing Common Sense Knowledge, Workshop on Non-
monotonic Reasoning, New Paltz, NY, sponsored by AAAI,
Oct. 17-19, 1984.
(86) J. McCarthy. Applictions of circumscription to formal-
izing common sense knowledge. Artificial Intelligence,
28:89-116, 1986.
(87) J. McCarthy. Circumscription - a form of non-monotonic
reasoning. Artificial intelligence, 13:27-39, 1980.
(88) J. McCarthy. Epistemological problems of artificial
intelligence. In Proceedings of the Fifth Interna-
tional Joint Conference on Artificial Intelligence,
pages 1038-1044, Cambridge, MA, 1977.
(89) McCarthy, J. and Hayes, P. [1969] Some philosophical
problems from the standpoint of artificial intelli-
gence. In Machine Intelligence 4, Meltzer, B. and
Michie, D. (eds.), Edinburgh University Press.
(90) McDermott, D. [1982] Non-monotonic logic II: non-
monotonic modal theories. Journal of the ACM, 29 (1),
pp. 33-57.
(91) McDermott, D. and Doyle, J. [1980] Non-monotonic logic
I. Artificial Intelligence, 13 (1,2), pp. 41-72.
(92) D. McDermott. AI, logic, and the frame problem. In
Proceedings of the 1987 Workshop on Logical Solutions
to the Frame Problem, Lawrence, Kansas, 1987.
(93) D. McDermott. A critique of pure reason. To appear.
(94) Mercer, R. and Rosenberg, R.S. [1984] Generating
corrective answers by computing presuppositions of
answers, not questions, or Mind your P's, not Q's. Proc
CSCSI-84, pp16-18.
(95) J. Minker and D. Perlis. Protected circumscription.
In Proceedings 1984 Non-monotonic Reasoning Workshop,
pages 337-343, American Association for Artificial
Intelligence, New Paltz, NY, 1984.
(96) Minker, J. [1982] On indefinite databases and the
closed-world assumption. Lecture Notes in Computer Sci-
ence, v. 138, pp. 292-308, Springer. (6th Conference on
Automated Deduction).
(97) Minker, J. and Perlis, D. [1984b] Applications of pro-
tected circumscription. Lecture Notes in Computer
Science, v. 170, pp. 414-425, Springer. (7th Conference
on Automated Deduction).
(98) M. Minsky. A framework for representing knowledge. In
P. Winston, editor, The Psychology of Computer Vision,
pages 211-277, McGraw-Hill, 1975.
(99) R. Moore. Semantical considerations on nonmonotonic
logic. Artificial Intelligence, 25:75-94, 1985.
(100)
Moore, R. [1975] Reasoning from incomplete knowledge in
a procedural deduction system. MIT AI Lab Memo 347.
(101)
Moore, R. [1983] Semantical considerations on non-
monotonic logic. Proc. 8th IJCAI, pp. 272-279.
(102)
J. Nutter. Default reasoning using monotonic logic: A
modest proposal. In Proceedings of the Third National
Conference on Artificial Intelligence, pages 297-300,
1983.
(103)
Nutter, J. [1983] Default reasoning in AI systems. MSc
Thesis, SUNY at Buffalo, Computer Science Tech. Report
204.
(104)
Nutter, J. [1983] What else is wrong with nonmonotonic
logics? Representational and informational shortcom-
ings. Proc. 5th Cognitive Science Conference, Roches-
ter.
(105)
Papalaskaris, M. A. and Bundy, A. [1984] Topics for
Circumscription. Workshop on Nonmonotonic Reasoning,
New Paltz, NY, sponsored by AAAI, Oct. 17-19, 1984.
(106)
Pena, L. [1980] The philosophical relevance of a con-
tradictorial system of logic. Proc. 10th Int'l Sympo-
sium on Multiple-valued Logic, pp. 238-252.
(107)
D. Perlis. Bibliography of literature on non-monotonic
reasoning. In Proceedings 1984 Non-monotonic Reasoning
Workshop, pages 396-401, American Association for
Artificial Intelligence, New Paltz, NY, 1984.
(108)
D. Perlis. On the consistency of commonsense reason-
ing. Computational Intelligence, 1987, pp??
(109)
Perlis, D. [1984] Non-monotonicity and real-time rea-
soning. Workshop on Nonmonotonic Reasoning, New Paltz,
NY, sponsored by AAAI, Oct. 17-19, 1984.
(110)
Perlis, D. [1987] Circumscribing with sets. Artificial
Intelligence.??
(111)
Perlis, D. [1987] Auto-circumscription. Draft??
(112)
D. Perlis and J. Minker. Completeness results for cir-
cumscription. Artificial Intelligence, 28:29-42, 1986.
(113)
R. Perrault. An Application of Default Logic to Speech
Act Theory. Technical Report, SRI International, 1987.
(114)
T. C. Przymusinski. Query-answering in circumscriptive
and closed-world theories. In Proceedings of the Fifth
National Conference on Artificial Intelligence, pages
186-190, 1986.
(115)
R. Reiter. Nonmonotonic reasoning. Annual Reviews of
Computer Science, 1987.
(116)
R. Reiter. On closed world data bases. In H. Gallaire
and J. Minker, editors, Logic and Data Bases, pages
119-140, Plenum, New York, 1978.
(117)
R. Reiter. A Theory of Diagnosis from First Princi-
ples. Technical Report 187/86, Computer Science
Department, University of Toronto, 1985.
(118)
Reiter, R. [1978] On closed world databases. In:
Logic and Databases, Gallaire, H. and Minker, J.
(eds.), Plenum, pp. 55-76.
(119)
Reiter, R. [1978] On reasoning by default. Proc
TINLAP-2, Urbanna, Ill.
(120)
Reiter, R. [1980] Equality and domain closure
in first-order databases. Journal of the ACM 27
(2), pp. 235-249.
(121)
Reiter, R. [1980] A logic for default reasoning, Artif-
icial Intelligence 13 (1,2), pp. 81-132.
(122)
Reiter, R. [1982] circumscription implies predi-
cate completion (sometimes). Proc. AAAI-82, pp.
418-420.
(123)
R. Reiter and G. Criscuolo. On interacting defaults.
In Proceedings of the Seventh International Joint
Conference on Artificial Intelligence, pages 270-276,
1981.
(124)
Reiter, R. and Criscuolo, G. [1983] Some representa-
tional issues in default reasoning. Int. J. Computers
and Mathematics (special issue on computational
linguistics).
(125)
Rescher, N. [1976] Plausible Inference. Van Gorcum,
Assen, The Netherlands.(126)
E. Rich. Default reasoning as likelihood reasoning.
In Proceedings of the Third National Conference on
Artificial Intelligence, pages 348-351, 1983.
(127)
S. Russell. The Compleat Guide to MRS. Technical
Report STAN-CS-85-1080, Stanford University, June 1985.
(128)
Sandewall, E. [1972] An approach to the frame problem
and its implementation. Machine Intelligence 7.
(129)
Sandewall, E. [1983] Partial models, attribute propoga-
tion systems, and non-monotonic semantics. Linkoping
University. LITH-IDA-R-83-01.
(130)
Shafer, G. [1976] A Mathematical Theory of Evidence.
Princeton Univ. Press.
(131)
J. C. Shepherdson. Negation as failure: A comparison
of Clark's completed data base and Reiter's closed
world assumption. J. Logic Programming, 1:51-79, 1984.
(132)
J. C. Shepherdson. Negation as failure II. J. Logic
Programming, 3:185- 202, 1985.
(133)
Y. Shoham. Chronological ignorance. In Proceedings of
the Fifth National Conference on Artificial Intelli-
gence, pages 389-393, 1986.
(134)
Y. Shoham. Non-monotonic logics. In M. L. Ginsberg,
editor, Readings in Non_Monotonic Reasoning, Morgan
Kaufmann, Los Altos, CA, 1987.
(135)
E. H. Shortliffe. Computer-based Medical Consulta-
tions: MYCIN, American Elsevier, New York, 1976.
(136)
Stalnaker, R. [1980] A note on non-monotonic modal
logic. Dept. of Philosophy, Cornell University.
(137)
Touretzky, D. [1984] The mathematics of inheritance
systems. Ph.D. Thesis, Carnegie-Mellon University.
(138)
D. S. Touretzky. Implicit ordering of defaults in
inheritance systems. In Proceedings of the Fifth
National Conference on Artificial Intelligence, pages
322-325, 1984.
(139)
Vere, S. [1980] Multi-level counterfactuals for gen-
eralizations of relational concepts and productions.
Artificial Intelligence, 14 (2), pp. 139-164.
(140)
A. Van Gelder. Negation as failure using tight deriva-
tions for general logic programs. In Proceedings of
the 1986 Workshop on Foundations of Deductive Databases
and Logic Programming, 1986.
(141)
Weyhrauch, R. [1980] Prolegomena to a theory of mechan-
ized formal reasoning Artificial Intelligence, 13
(1,2), pp. 133-170.
(142)
Winograd, T. [1980] Extended inference modes in reason-
ing by computer systems. Artificial Intelligence 13
(1,2), pp. 5-26.
(143)
A. Yahya and L. J. Henschen. Deduction in non-Horn
databases. Journal of Automated Reasoning, 1:141-160,
1985.
(144)
Non-Monotonic Reasoning Workshop, New Paltz, NY, 1984.
(145)
Workshop on Logical Solutions to the Frame Problem,
Morgan Kaufmann, Lawrence, KS, 1987.
(146)
Workshop on Uncertainty and Probability in Artificial
Intelligence, UCLA, Los Angeles, California, 1985.
(147)
Workshop on Uncertainty in Artificial Intelligence,
University of Pennsylvania, Philadelphia, PA, 1986.
∂07-Apr-87 1846 daniel@mojave.stanford.edu David McAllester
Received: from MOJAVE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 7 Apr 87 18:46:06 PDT
Received: by mojave.stanford.edu; Tue, 7 Apr 87 18:47:01 PST
Date: Tue, 7 Apr 87 18:47:01 PST
From: Daniel Weise <daniel@mojave.stanford.edu>
To: nilsson@score.stanford.edu, manna@score.stanford.edu,
jmc@sail.stanford.edu, pratt@score.stanford.edu
To: genesereth@sumex-aim.stanford.edu, shoham@score.stanford.edu,
waldinger@sail.stanford.edu
Cc: daniel@mojave.stanford.edu
Subject: David McAllester
Are any of you interested in talking with, or having
dinner with, David McAllester from MIT? Can you think
of others who might be interested in talking with him?
He is giving the colloquiem talk next tuesday.
Ontic:
A Knowledge Representation Language
for Mathematics
Ontic is an interactive system for developing and verifying
mathematics. The system appears to be able to verify "proofs" that
are only one to three times longer than corresponding previously
published English arguments. Furthermore, the structure of the
machine readable proofs closely matches the structure of the English
arguments. Ontic's ability to read concise proofs is based on a
mechanism for automatically finding and applying information from a
lemma library containing hundreds of mathematical facts. Starting
with only the axioms of Zermello Fraenkel set theory, the Ontic system
has been used to build a data base of definitions and lemmas
culminating in a proof of the Stone representation theorem for Boolean
lattices. This proof involves an ultrafilter construction and is
similar in complexity to the Tychonoff theorem that an arbitrary
product of compact spaces is compact. This talk will discuss the
structure of Ontic's machine readable proofs, the automatic theorem
proving mechanisms used, and the empirically observed differences
between Ontic's proofs and English arguments.
∂08-Apr-87 0826 NILSSON@score.stanford.edu Re: Friedman
Received: from NAVAJO.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 8 Apr 87 08:26:50 PDT
Received: from Score.Stanford.EDU by navajo.stanford.edu with TCP; Wed, 8 Apr 87 08:25:57 PST
Date: Wed 8 Apr 87 08:24:00-PDT
From: Nils Nilsson <NILSSON@score.stanford.edu>
Subject: Re: Friedman
To: PAPA@score.stanford.edu
Cc: fndsch@navajo.stanford.edu, NILSSON@score.stanford.edu
In-Reply-To: <12292722500.20.PAPA@Score.Stanford.EDU>
Message-Id: <12292886800.27.NILSSON@Score.Stanford.EDU>
Pls keep me posted on progress with Math. Should I come to the mtg
tomorrow with Sarnak and Royden? Also, we should coordinate the
phoning about offers. We should call Friedman/Mitchell/Goldberg
right away, I think, with some report of progress, to make sure they
don't precipitously make some non-Stanford decision. Should I do that?
In the meantime, I'll be having my mtg with the Deanery. -Nils
-------
∂08-Apr-87 1014 RA John Nafeh
Please call John Nafeh.
∂08-Apr-87 1102 CLT darpa
To: JMC, LES
I talked to Scherlis this morning.
He said he had seen a work order for the MTC part
cross his desk and that we should have funding
(at the level requested) soon (assuming no unforseen glitches).
He checked with Simpson and said that the AI part
would likely not get funding til October.
∂08-Apr-87 2116 forbus@p.cs.uiuc.edu Invitation to Qualitative Physics Workshop
Received: from A.CS.UIUC.EDU by SAIL.STANFORD.EDU with TCP; 8 Apr 87 21:16:31 PDT
Received: from p.cs.uiuc.edu by a.cs.uiuc.edu with SMTP (UIUC-5.52/9.7)
id AA15732; Wed, 8 Apr 87 22:17:00 CST
Received: by p.cs.uiuc.edu (UIUC-5.52/9.7)
id AA13414; Wed, 8 Apr 87 22:17:59 CST
Date: Wed, 8 Apr 87 22:17:59 CST
From: forbus@p.cs.uiuc.edu (Kenneth Forbus)
Message-Id: <8704090417.AA13414@p.cs.uiuc.edu>
To: jmc@sail.stanford.edu
Subject: Invitation to Qualitative Physics Workshop
Cc: forbus@p.cs.uiuc.edu
We discussed this in person the night before the AAAI-87 program
committee meeting, this is a reminder:
You are cordially invited to be an "honored guest" at the Qualitative
Physics Workshop, sponsored by AAAI, being held at Urbana this May.
It will run from May 27 through May 29th, inclusive. We do not expect
you to give a talk, although if you come we may dragoon you and/or Pat
Hayes into giving an after-dinner speech. Please let me know if you
can attend. Take care.
Ken Forbus
∂09-Apr-87 1104 mcdermott-drew@yale.ARPA Hopcroft report
Received: from YALE-ENG-VENUS.ARPA by SAIL.STANFORD.EDU with TCP; 9 Apr 87 11:02:07 PDT
Date: 9 APR 1987 13:58:57 EST
From: <MCDERMOTT-DREW@YALE.ARPA>
To: JMC@SAIL.STANFORD.EDU,NILSSON@Score.Stanford. EDU,POGGIO%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU
Subject: Hopcroft report
Reply-To: <MCDERMOTT-DREW@YALE.ARPA>
John Hopcroft asked me to massage the three pieces of report that you guys
wrote into a coherent blurb about AI. He has seen the result, and liked it,
and I wanted to make sure I hadn't distorted what you wrote too badly.
Send comments to me.
-- Drew McD
\documentstyle [11pt]{article}
\begin{document}
\begin{center}
AI is a Science \\
\bigskip
Drew McDermott \\
Yale University \\
\bigskip
John McCarthy \\
Nils Nilsson \\
Stanford University \\
\bigskip
Tomaso Poggio \\
MIT
\end{center}
\bigskip
In some European countries, computer science is called ``informatics,'' and
that's a better name for it than ``computer science.'' The invention of the
computer coincided with the discovery of information, or, more precisely,
the ``objectification'' of information.
Before the invention of the computer, information was
something that was transmitted and stored, but could be processed only
when examined by a human being. The human was what made it
information, by giving it meaning. The computer made it obvious how one
could build autonomous, formal agents that could process and condense
information while respecting its meaning. A payroll program
performs a long serious of uninspired actions, and the {\it right answer}
pops out.
With this idea, it became conceivable that our original picture of the
relationship between humans and information processing could be stood on
its head. Instead of humans making information processing possible,
perhaps information processing makes humans possible. That is, perhaps
the operation of the mind is to be understood in terms of many small acts
of computing going on in one's brain. This idea has captured the
imagination of an entire generation of researchers since it was first
proposed by Alan Turing. It has changed the way many psychologists and
philosophers think about the mind. Not everyone agrees that all mental
activity can be explained in terms of computation. But it is obvious by
now that large parts of what the brain does, in vision and natural-language
processing, for instance, can be analyzed as symbolic or
numerical computing, and it seems pointless to draw a boundary line
around other parts of the mind where computing must not trespass. We can
then define AI as the science that studies mental faculties with
computational models. How much of the mind can ultimately be accounted for
this way is as yet unknown.
Many are perhaps unaware of the impact AI is having on attitudes toward
the mind. A new branch of psychology, cognitive psychology, came into
being in the late fifties, inspired by the work of Newell and Simon in
AI. The work of
the cognitive psychologists has revivified psychology in many ways. If it
has had no other effect, it has helped to sweep away the cobwebs of
behaviorism, whose models of man are absurdly simple. For example, work
on visual imagery, which had all but died out during the dark ages of
behaviorism, is now alive and well.
Philosophy has been influenced by AI as well. One of the most debated
questions in the philosophy of mind is the status of ``functionalism,''
which explains mental states as analogues of the states of computers.
Many philosophers believe that this kind of model explains much of
psychology; the debate is whether it is compatible with the facts of
consciousness and intentionality. This debate could not be held without
the production of actual models of mind by AI researchers.
It is not easy to describe AI tidily. At this early stage,
it is not yet clear whether AI is based on a few fundamental
principles, or is a loose affiliation of several different subfields,
each concentrating on a different part of the mind, or on different
applications.
One candidate for unifying principle is the idea of
{\it knowledge representation.} Although in some sense any computer
program embodies knowledge (if only of what to do next), AI programs are
unique in that they
often make inferences from complex pieces of knowledge
expressed in general notations.
The knowledge implicit in a procedure
is made manifest only by executing that procedure, whereas
knowledge represented {\it declaratively} --- as a set of neutral facts ---
is explicit from the start, and accessible in more than one way.
Indeed, it can be assembled, analyzed, and debugged before we have decided
upon {\it any} particular way of using it,
just as the laws of Newtonian mechanics can be
expressed in relatively use-independent, mathematical equations and then
later applied for many purposes.
An important
requirement for a useful representation language is that the meaning of
sentences in the language should depend {\it compositionally} only on
the meanings of the constituent structures of the sentence and not on
the meanings of other sentences or on other surrounding context.
Hence, we are naturally led to the use of logic-based notations,
in particular, various versions of the
first-order predicate calculus (with occasional non-classical
extensions, such as modal operators). Curiously, AI is in a way the {\it
first} user of these notations, at least the first since Bertrand Russell.
Logicians invented predicate calculus as an actual notation, but
their attention soon wandered to
metaquestions about the power of such systems.
No one needed the sharp formality of such notations until,
starting in the late sixties, AI researchers came to realize that computers
could not achieve sophistication in various reasoning tasks unless they had
formal encodings of
large quantities of information about their problem domains.
This realization soon led
to the elaboration of new problems:
\begin{enumerate}
\item What can be expressed in formal languages?
\item How is the knowledge to be embodied in computer data structures?
\item What reasoning algorithms can be brought to bear?
\item How is new knowledge acquired?
\end{enumerate}
Many of these problems now have at least partial solutions.
The most basic question is, What can be expressed in formal languages?
So far, no fundamental obstacle has been found to expressing almost anything.
There are by now several detailed frameworks for representing
general facts about time, physics, and the mental states of agents,
as well as more specific facts about
medicine, business,
geology and other subjects (the territory of ``expert systems'').
It remains to be seen whether these pieces can be put together
into a whole that covers a large chunk of human knowledge.
It is worthwhile studying formal languages in isolation, but for the computer
to make use of them they must be embodied in data structures. There are now
several knowns ways of doing this, depending on the application. Many of them
involve translating logical assertions into systems of nodes, with links between
them that can be followed by computer programs to perform inferences
efficiently.
The study of reasoning algorithms has a somewhat different flavor. The initial
focus of work in this area was on making deduction more efficient. The
result was the discovery of elegant algorithms, based on Robinson's {\it
resolution} principle, and employing the {\it unification} algorithm to
deal with variables. Our understanding of how to carry out deduction has
been revolutionized by discoveries like this.
But for
any given application there are many nondeductive components. Hence there has
been a blossoming of several different reasoning algorithms, and an undermining
of the notion of a general foundational principle for AI. In practice, each
reasoning algorithm follows its own domain-dependent strategies, and tends
to demand somewhat different knowledge-representation techniques.
Since it would be nice to have a general theory of reasoning, this state of
affairs has exerted a pull on AI theory to come up with broader reasoning
algorithms. One result has been the study of {\it nonmonotonic logics}, or
pseudo-deductive systems in which conclusions are ``defeasible,'' that is,
revokable given more information. There are several paradigms for accomplishing
this extension of traditional deduction. Most of the results are in
McCarthy's {\it circumscription} framework. {\it Circumscribing} a predicate
$P$ in a theory means adding an axiom schema or second-order axiom to the
effect that, ``Any predicate $P'$ that satisfied the same laws as $P$ and is
as strong as $P$ is no stronger.'' In symbols,
\begin{displaymath}
{\rm Laws}[P'/P]\supset (\forall x (P'(x)\supset P(x)))\supset (\forall x (P(x)\supset P'(x))))
\end{displaymath}
This new axiom allows us to
conclude $\neg P(\ldots)$ in more circumstances; in semantic terms, it
rules out all models of the original facts about $P$ except the {\it minimal
models}, those in which $P$'s extension is as small as possible. (Different
versions of the circumscription axiom yield different kinds of minimality.)
Circumscription is nonmonotonic because adding more facts about $P$ and
recircumscribing can eliminate conclusions.
Many of the new reasoning patterns discovered by AI researchers have not
been reduced to deduction (and it is not clear whether deduction can be
extended to capture them). Hence they must be taken on their own terms.
One example is the work on {\it qualitative
physics} by DeKleer and Brown, Forbus, and Kuipers. Quantitative simulation
is in the domain of scientific computing; but human engineers can often
predict or explain the behavior of a system without needing detailed
numbers describing its components. Elegant methods now exist for predicting
as specifically as possible the behavior of a system,
starting from a qualitative
description of how its parts interact. One can think of these descriptions
as ``qualitative differential equations,'' which specify the directions in
which state variables influence each other without specifying the magnitudes.
The prediction algorithms note the directions in which quantities are
changing, and the interesting thresholds towards which they are heading.
If just one quantity can reach its threshold next, that tells the program
unambiguously what the next ``qualitative state'' of the system will be.
{\it Qualitative states} can be defined technically as regions in state
space where all quantity-influence relations remain the same. In many
cases, the behavior of
the system is underspecified, and more than one qualitative state
is a possible successor to the current one; the system pursues all
possibilities. The ultimate result is a finite graph of qualitative states,
showing all possible behaviors of the system.
An investigation of the AI literature reveals a multiplicity of
reasoning methods like this. It is not yet clear what unifying principles
underlie them, if indeed any do. Our situation is like that of the physicists
in the fifties, before the proposal of quarks: we have too many results, as
it were.
If knowledge, its representations, and reasoning algorithms to manipulate it
are indeed central to AI, then the problem of machine learning --- the
automatic acquisition of new
facts and reasoning methods --- is crucial.
Here, too, various powerful techniques have been discovered, but no unifying
principles. In fact, the absence of unifying principles may be counted as
a major scientific discovery of AI. The idea that all mental activity might
be explainable in terms of learning, in an organism that starts as a {\it
tabula rasa}, has been discredited by the discovery that certain apparently
plausible unifying mechanisms are in fact meaningless. For hundreds of years,
psychologists and philosophers have thought that the basic mechanism of
learning was the transference of successful behavior in a situation to
novel but similar situations. When one attempts to
computationalize this idea, one discovers that there is no such thing as
intrinsic similarity. Two situations are similar if some algorithm says
they are, and any algorithm must neglect some differences. Hence for any
two situations some algorithm will say they are similar, and we are left with
the problem of devising algorithms for particular domains. It is now clear
that an algorithm for, say, learning cognitive maps will have little to do
with one for learning language. There is no choice but to study such problems
on their own terms. As a result, in learning as elsewhere, we now know a little
bit about a profusion of learning tasks.
Some general principles have emerged. We can make a distinction between
{\it internal} and {\it external} learning. The former is learning
consequences of what you already in some sense knew, as when you improve
your skill at applying methods of symbolic integration.
External learning is acquisition of genuinely new facts, as when you
learn physical laws. The former can profit from the powerful technique
known as {\it explanation-based learning}, investigated by Sussman, DeJong,
Mitchell,
and others. This method consists of extracting from a particular
problem-solving session a general principle that will allow similar problems
to be solved faster later, by skipping over intermediate steps. Essentially
the method operates by explaining success on this problem
in terms that can be applied quickly
to later episodes.
For external learning, guaranteed explanations are not obtainable.
When learning a new law,
a learning
program must search through the space of possible versions of the law,
trying experiments or making observations to rule incorrect versions out.
When the language of the law is simple enough that all possible versions
can be expressed as a lattice of more general and less general candidates,
then one can keep track of exactly which versions are still viable by
keeping track of the upper and lower bounds in the lattice within which
the correct version lies. As more observations come in, they can be used
to narrow the bounds. When applicable, this idea (due to Mitchell)
allows a ``binary search''
through the set of candidate laws.
Not all subfields of AI are oriented around knowledge representation.
{\it Computer vision},
the attempt to understand how information can be
extracted from the light bouncing off objects, is a good example.
As we will discuss below, vision algorithms must embody a lot of knowledge
about optics, but they do not need to represent it declaratively.
This distinction has not prevented it from developing
some of the most satisfying results in AI.
Before computational
methods were used, vision theory had progressed only a little way beyond
optics. Electrodes could be stuck into cells in visual cortex, but their
signals were a mystery. Since 1970 or thereabouts, vision researchers
have produced a plethora of detailed models of different aspects of vision.
Many (if not all) workers believe that the job of the visual system is to
build a symbolic description of what it is looking at. Computer science
tells us what sort of thing a symbolic description is; we don't know where
to locate it in the brain, but we know we're looking for it.
Problems in vision are usually classified as part of low-level (or
``early'') vision or part of high-level vision. Early vision performs
the first steps in processing images through the operation of a set of
visual modules such as edge detection, motion, shape-from-contours,
shape-from-texture, shape-from-shading, binocular stereo, surface
reconstruction, and surface color; its goal is to yield a map of the
physical surfaces around the viewer. High-level vision can be
identified with the ``later'' problems of object recognition and shape
representation.
The problem of vision begins with a large array of numbers recording an
intensity value for each pixel (picture element) in the image. The
precise value at each pixel depends not only on the color and texture
of the 3-D surface that is reflecting the light but also on the
orientation and distance of the surface with respect to the viewer, on
the intensity, color and geometry of the illumination, on the shadows
cast by other objects, and so on. The goal of early vision is to
unscramble the information about the physical properties of the
surfaces -- distance, orientation, and material properties -- from the
image data. Early vision is therefore the science of inverse optics. In
classical optics or computer graphics the basic problem is to
determine the 2-D images of 3-D objects, whereas vision (whether biological
or artificial) is confronted with the inverse problem of recovering
3-D surface from 2-D images. In color, for instance, the goal of
vision is to decode the measured lights in terms of the reflectance of
the surfaces and the spectral power distribution of the illuminant.
This inverse problem is very difficult to solve, despite the apparent
ease and reliability with which {\it our} visual system gives
meaningful descriptions of the world around us. The difficulty is at
least twofold. First, the amount of information to be processed is
staggering: a high resolution TV frame is equivalent to one million
pixels, each containing 8 bits of information about light intensity,
making a total of $8 x 10↑6$ bits. The image captured by the human eye
is even more densely sampled (in the human eye there are in excess of
100 million photoreceptors). Real-time visual processing must be able
to deal with many such frames per second. It is therefore not
surprising that even the simplest operations on the flow of images ---
such as filtering --- require billions of multiplications and additions
per second. Second and more importantly, the images are highly
ambiguous: despite the huge number of bits it turns out that they do
not contain {\it enough} information about the 3-D world. During the
imaging step that projects 3-D surfaces into 2-D images, much
information is lost. The inverse transformation, from the 2-D image
to the 3-D object that produced it, is therefore underdetermined.
The natural way to approach this problem is to exploit {\it a priori}
knowledge about our 3-D world to remove the ambiguities of the inverse
mapping. One of the major achievements of computer vision work in the
last decade is the demonstration that {\it generic} natural
constraints, that is, general assumptions about the physical world
that are correct in almost all situations,\footnote{The term
{\it generic} is used here in the same sense as in the mathematical
theory of dynamical systems.} are sufficient to solve the problems of
early vision. Very specific, high-level, domain-dependent knowledge
is not needed.
Two main themes are therefore intertwined at the heart of the main
achievement of early vision research. They are: a) the identification
and characterization of generic constraints for each problem and
b) their use in an algorithm to solve the problem.
Some of the most powerful constraints reflect generic
properties of 3-D surfaces. One of the best examples is the recovery of
structure from motion. Perceptual studies show that a temporal sequence
of images of an object in motion yields information about its 3-D
structure. Consider for instance a rotating cylinder with a textured
surface: its 3-D shape becomes immediately evident as soon as rotation
begins. It has been proved that 3-D shape can be computed from a small
number of identified points across a small number of frames {\it if} one
assumes that the surface is {\it rigid}. Various theorems characterize
almost completely the minimum number of points and frames that are
required. {\it Continuity} of surfaces is another useful assumption:
surfaces are typically regions of coherent aggregates of matter, do not
consist of scattered points at different spatial locations and are
usually smooth. This constraint is very powerful for solving the
correspondence problem in stereo and motion and for reconstructing
surfaces from sparse depth points. \footnote{Of course,
constraints of this type are occasionally violated. In these cases
algorithms that strictly enforce them will suffer from ``visual
illusions''.}
It is natural to ask whether a general method exists for formalizing
these constraints in each specific case and translating them into
algorithms. An answer to this question has emerged in the last two
years. We will describe it as a representative point of view, though
by no means the only possible one.
This unifying theoretical framework is based on the recognition that
most early vision problems are mathematically ill-posed problems (in the
sense of Hadamard). A problem is well posed when its solution exists,
is unique, and depends continuously on the initial data. Ill-posed
problems fail to satisfy one or more of these criteria. In vision, edge
detection -- the detection and localization of sharp intensity changes
-- is ill posed when considered as a problem of numerical
differentiation, because the result does not depend continuously on the
data. Another example is the reconstruction of 3-D surfaces from sparse
data points, which is ill posed for a different reason: the data alone,
without further constraints, allow an infinite number of solutions, so
that uniqueness is not guaranteed without further assumptions.
The main idea in mathematics for ``solving'' ill-posed problems --
that is, for restoring well-posedness -- is to restrict the space of
admissible solutions by introducing suitable {\it a priori} knowledge.
In vision, this is identical to exploiting the natural constraints
described earlier. Mathematicians have developed several formal
techniques for achieving this goal that go under the name of
regularization theory.
In standard regularization the solution is found as the function that
minimizes a certain convex functional. This functional can be regarded
as an ``energy'' or a ``cost'' that measures how close the solution is
to the data and how well it respects the a priori knowledge about its
properties. Consider the direct problem of finding $y$, given $z$ and
the mapping $A$:
$$Az = y.$$
The inverse and usually ill-posed problem is to find $z$ from $y$.
Standard regularization suggests transforming Equation (1) into a
variational problem by writing a cost functional consisting of two
terms. The first term measures the distance between the data and the
desired solution $z$; the second term measure the cost associated
with a functional of the solution $\|Pz\|$ that embeds the {\it a
priori} information on $z$. In summary, the problem is reduced to
finding $z$ that minimizes
$${\|Az-y\|}↑2 + \lambda\|Pz\|$$
where $\lambda$, the regularization parameter, controls the compromise
between the degree of regularization of the solution and its closeness
to the data. Mathematical results characterize various properties of
this method such as uniqueness and behavior of the solution.
Solutions of this type have been obtained for several early vision
problems: edge detection, optical flow, surface reconstruction,
spatiotemporal approximation, color, shape from shading, stereo.
Computer vision has always had a special two-way
relationship with brain sciences: suggestions from visual physiology and
psychophysics have played a role in many developments of computer
vision. For instance, discoveries of neurons that seem to behave as edge
detectors in the visual cortex of primates had a significant influence
in the development of early computer vision programs. In turn,
computational theories of vision are now influencing the psychophysics
and the physiology of vision. It is very likely that this trend will
grow more important for both fields.
Mainly because of the theoretical advances of the last decade, it
seems that early vision is now on its way to a systematic solution.
Much less has been accomplished in high-level vision. At the level
of object recognition and scene description, the vision system begins
to blend with the rest of the mind, about which elegant unifying theories
do not yet exist.
In summary, AI is in a way the branch of computer science that is most
nearly a classical empirical science. It studies the world at the
computational level, in much the same way that chemistry studies the world
at the chemical level. It is not {\it a priori} obvious that there {\it is}
a chemical level; in principle, everything is just physics. But in many
situations it is possible --- and necessary --- to ignore the details of
elementary-particle interactions, and focus on interactions in terms of
{\it molecular bonds}, {\it valence}, {\it stoichiometry},
{\it reaction rates}, etc.
Similarly, in principle the brain's functioning can be explained in terms
of the behavior of its neurons and their membranes. But it appears, and
this is definitely a falsifiable claim, that many of these details can
be neglected, and attention focused on the {\it information} that the neurons
are transmitting, and the {\it computations} they are doing. If this is
approximately correct, then it may be just as necessary to focus on this
higher level in understanding the brain as it is to focus on the chemical
level in understanding chemical systems.
The nervous system is not the only place in the universe where nature has
exploited computation. Another good candidate is the operation of the
cells of organisms. Although in principle the behavior of DNA
is describable chemically, the important thing about a particular DNA
molecule is the message encoded in its nucleotides, and this message is
completely {\it arbitrary} from a chemical point of view. In many cases
the only reasonable way to describe the operation of a cell is at
a computational level in which genes are thought of as
switching each other on and off, so that the set of active genes behaves like
the state of a computing device, the next state and the outputs (proteins)
being functions of the current
inputs and the previous state.
The study of such molecular computers --- if they really do exist --- might
or might not be assimilated to artificial intelligence. Indeed, it is not
clear whether in the long run AI will be stable as a single discipline, or split up
along mental-module boundaries that are yet to be discovered. The point
to absorb is that computation does exist in nature as well as in artifacts;
its study is now emerging as a new empirical science.
\end{document}
-------
∂09-Apr-87 1112 RA Pam Widrin, Alliant
Widrin called re customer reference; her tel. (408) 295 7222.
∂09-Apr-87 1120 RA Sarah
Sarah would like you to call her.
∂09-Apr-87 1325 @RELAY.CS.NET,@ai.toronto.edu,@utterly.ai.toronto.edu:hector@mc.lcs.mit.edu Mcdermott critique
Received: from RELAY.CS.NET by SAIL.STANFORD.EDU with TCP; 9 Apr 87 13:25:19 PDT
Received: from ai.toronto.edu by RELAY.CS.NET id aa23333; 9 Apr 87 16:05 EDT
Received: from utterly.ai.toronto.edu by ai.toronto.edu via ETHER with SMTP id AA19116; Thu, 9 Apr 87 15:54:37 EDT
Received: from ai by utterly.ai.toronto.edu via ETHER with SMTP id AA00843; Thu, 9 Apr 87 14:59:49 EST
Message-Id: <8704091959.AA00843@utterly.ai.toronto.edu>
Date: 09 Apr 87 14:59:35 EST (Thu)
From: Hector Levesque <hector%ai.toronto.edu@RELAY.CS.NET>
To: james%rochester.edu@RELAY.CS.NET, bobrow@XEROX.COM, stefik@XEROX.COM,
kabowen%syr.csnet@RELAY.CS.NET, rjb%allegra.uucp@RELAY.CS.NET,
ec%cs.brown.edu@RELAY.CS.NET, dekleer.pa@XEROX.COM,
jon.doyle@C.CS.CMU.EDU, forbus@P.CS.UIUC.EDU,
phayes%kl.sri.com@RELAY.CS.NET, hayes@SPAR-20.ARPA, hewitt@XX.LCS.MIT.EDU,
hinton@C.CS.CMU.EDU, hobbs%warbucks.sri.com@RELAY.CS.NET,
israel%warbucks.sri.com@RELAY.CS.NET, jmc@SAIL.STANFORD.EDU,
val@SAIL.STANFORD.EDU, bmoore%ai.sri.com@RELAY.CS.NET,
nilsson@SCORE.STANFORD.EDU, pentland%ai.sri.com@RELAY.CS.NET,
watdaisy!dlpoole%watmath.uucp@RELAY.CS.NET,
reiter%ai.toronto.edu@RELAY.CS.NET, stan%ai.sri.com@RELAY.CS.NET,
alberta!lksc%ubc-vision.uucp@RELAY.CS.NET, briansmith@XEROX.COM,
stickel%ai.sri.com@RELAY.CS.NET, tyson%ai.sri.com@RELAY.CS.NET,
waldinger%sri.com@RELAY.CS.NET, tw@CSLI.STANFORD.EDU, wwoods@BBN.COM
Subject: Mcdermott critique
Cc: mcdermott-drew%yale.edu@RELAY.CS.NET
Dear Contributor,
Yes, the issue is still alive! McDermott has all commentaries in hand, and I
almost have his reply in hand. (A draft in hand is easily worth two final
versions in the bush.) The plan is to ship everything to COMPUTATIONAL
INTELLIGENCE (including a short introduction by me) on the weekend after
Easter. Then, to keep things moving along and except for a few long
submissions, I will proofread the galleys and fix the typos. If all goes well
and with some luck, the issue will appear sometime between AAAI and IJCAI.
So what do I need from you?? Just acknowledge this message (so I won't have
to contact you by phone or snail mail) and either tell me that you're going
with what you sent me, or that you'll send me an update by April 24th. Also,
if you would much prefer to see the galleys afterwards, let me know and I will
send them to you for proofreading (but, nota bene, time pressure will be on).
By the way, the issue should be quite good! To remind you, I have
commentaries from: James Allen and Henry Kautz, Danny Bobrow and Mark Stefik,
Ken Bowen, Ron Brachman, Eugene Charniak, Johan deKleer, Jon Doyle, Ken
Forbus, Pat Hayes, Carl Hewitt, Robert Kowalski, Robert Moore, Geoff Hinton,
Jerry Hobbs, David Israel, John McCarthy and Vladimir Lifschitz, Nils Nilsson,
Sandy Pentland, David Poole, Ray Reiter, Stan Rosenschein, Len Schubert, Brian
Smith, Mark Stickel and Mabry Tyson, Richard Waldinger, Terry Winograd, and
Bill Woods. A nice mix, I hope you agree.
Please answer this message immediately!!!
Hector Levesque
New-fangled Internet: hector@ai.toronto.edu
Old-style ARPA: hector%toronto.csnet@CSNET-RELAY
Old-style CSNET: hector@toronto
UUCP: ...{utai,utcsri}!hector
REGULAR: Dept. of Computer Science
University of Toronto
Toronto, Ont. M5S 1A4
CANADA.
PHONE: (416) 978-3618
P.S. Sorry if you already received this message. I'm struggling with new
Internet formats and UNIX 4.3.
∂09-Apr-87 1343 VAL re: Mcdermott critique
To: hector%ai.toronto.edu@RELAY.CS.NET
CC: JMC@SAIL.STANFORD.EDU
[In reply to message from hector%ai.toronto.edu@RELAY.CS.NET sent 09 Apr 87 14:59:35 EST.]
John is in Japan now, but my understanding is that we won't be sending you any
updates, and it's not necessary to send us the galleys.
Regards,
Vladimir
∂09-Apr-87 1417 PERLAKI@Score.Stanford.EDU airline ticket
Received: from SCORE.STANFORD.EDU by SAIL.STANFORD.EDU with TCP; 9 Apr 87 14:17:03 PDT
Date: Thu 9 Apr 87 14:11:58-PDT
From: Agnes M. Perlaki <PERLAKI@Score.Stanford.EDU>
Subject: airline ticket
To: ra@Sail.Stanford.EDU
cc: jmc@Sail.Stanford.EDU
Message-ID: <12293212290.42.PERLAKI@Score.Stanford.EDU>
I received Professor McCarthy's ticket in your absense. I will keep
it here at the desk untill you return.
-Agi
-------
∂09-Apr-87 2038 AI.NOVAK@R20.UTEXAS.EDU AI
Received: from R20.UTEXAS.EDU by SAIL.STANFORD.EDU with TCP; 9 Apr 87 20:38:20 PDT
Date: Thu 9 Apr 87 22:39:00-CDT
From: Gordon Novak Jr. <AI.NOVAK@R20.UTEXAS.EDU>
Subject: AI
To: jmc@SAIL.STANFORD.EDU, clt@SAIL.STANFORD.EDU
Message-ID: <12293282748.38.AI.NOVAK@R20.UTEXAS.EDU>
I am delighted to hear of your plans. If there is anything that I can
do to help out in any way, please don't hesitate to ask.
Regards, Gordon
-------
∂10-Apr-87 0900 JMC
qlisp